<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>STX B+ Tree Template Classes: stx/btree.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />

<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">STX B+ Tree Template Classes
   &#160;<span id="projectnumber">0.9</span>
   </div>
   
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.6.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="namespaces.html"><span>Namespaces</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
</div>
<div class="header">
  <div class="headertitle">
<div class="title">stx/btree.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="a00026.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/**</span>
<a name="l00002"></a>00002 <span class="comment"> * \file include/stx/btree.h</span>
<a name="l00003"></a>00003 <span class="comment"> * Contains the main B+ tree implementation template class btree.</span>
<a name="l00004"></a>00004 <span class="comment"> */</span>
<a name="l00005"></a>00005 
<a name="l00006"></a>00006 <span class="comment">/*</span>
<a name="l00007"></a>00007 <span class="comment"> * STX B+ Tree Template Classes v0.9</span>
<a name="l00008"></a>00008 <span class="comment"> * Copyright (C) 2008-2013 Timo Bingmann &lt;tb@panthema.net&gt;</span>
<a name="l00009"></a>00009 <span class="comment"> *</span>
<a name="l00010"></a>00010 <span class="comment"> * Boost Software License - Version 1.0 - August 17th, 2003</span>
<a name="l00011"></a>00011 <span class="comment"> *</span>
<a name="l00012"></a>00012 <span class="comment"> * Permission is hereby granted, free of charge, to any person or organization</span>
<a name="l00013"></a>00013 <span class="comment"> * obtaining a copy of the software and accompanying documentation covered by</span>
<a name="l00014"></a>00014 <span class="comment"> * this license (the &quot;Software&quot;) to use, reproduce, display, distribute,</span>
<a name="l00015"></a>00015 <span class="comment"> * execute, and transmit the Software, and to prepare derivative works of the</span>
<a name="l00016"></a>00016 <span class="comment"> * Software, and to permit third-parties to whom the Software is furnished to</span>
<a name="l00017"></a>00017 <span class="comment"> * do so, all subject to the following:</span>
<a name="l00018"></a>00018 <span class="comment"> *</span>
<a name="l00019"></a>00019 <span class="comment"> * The copyright notices in the Software and this entire statement, including</span>
<a name="l00020"></a>00020 <span class="comment"> * the above license grant, this restriction and the following disclaimer, must</span>
<a name="l00021"></a>00021 <span class="comment"> * be included in all copies of the Software, in whole or in part, and all</span>
<a name="l00022"></a>00022 <span class="comment"> * derivative works of the Software, unless such copies or derivative works are</span>
<a name="l00023"></a>00023 <span class="comment"> * solely in the form of machine-executable object code generated by a source</span>
<a name="l00024"></a>00024 <span class="comment"> * language processor.</span>
<a name="l00025"></a>00025 <span class="comment"> *</span>
<a name="l00026"></a>00026 <span class="comment"> * THE SOFTWARE IS PROVIDED &quot;AS IS&quot;, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR</span>
<a name="l00027"></a>00027 <span class="comment"> * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,</span>
<a name="l00028"></a>00028 <span class="comment"> * FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT</span>
<a name="l00029"></a>00029 <span class="comment"> * SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE</span>
<a name="l00030"></a>00030 <span class="comment"> * FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,</span>
<a name="l00031"></a>00031 <span class="comment"> * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER</span>
<a name="l00032"></a>00032 <span class="comment"> * DEALINGS IN THE SOFTWARE.</span>
<a name="l00033"></a>00033 <span class="comment"> */</span>
<a name="l00034"></a>00034 
<a name="l00035"></a>00035 <span class="preprocessor">#ifndef _STX_BTREE_H_</span>
<a name="l00036"></a>00036 <span class="preprocessor"></span><span class="preprocessor">#define _STX_BTREE_H_</span>
<a name="l00037"></a>00037 <span class="preprocessor"></span>
<a name="l00038"></a>00038 <span class="comment">// *** Required Headers from the STL</span>
<a name="l00039"></a>00039 
<a name="l00040"></a>00040 <span class="preprocessor">#include &lt;algorithm&gt;</span>
<a name="l00041"></a>00041 <span class="preprocessor">#include &lt;functional&gt;</span>
<a name="l00042"></a>00042 <span class="preprocessor">#include &lt;istream&gt;</span>
<a name="l00043"></a>00043 <span class="preprocessor">#include &lt;ostream&gt;</span>
<a name="l00044"></a>00044 <span class="preprocessor">#include &lt;memory&gt;</span>
<a name="l00045"></a>00045 <span class="preprocessor">#include &lt;cstddef&gt;</span>
<a name="l00046"></a>00046 <span class="preprocessor">#include &lt;assert.h&gt;</span>
<a name="l00047"></a>00047 
<a name="l00048"></a>00048 <span class="comment">// *** Debugging Macros</span>
<a name="l00049"></a>00049 
<a name="l00050"></a>00050 <span class="preprocessor">#ifdef BTREE_DEBUG</span>
<a name="l00051"></a>00051 <span class="preprocessor"></span>
<a name="l00052"></a>00052 <span class="preprocessor">#include &lt;iostream&gt;</span>
<a name="l00053"></a>00053 <span class="comment"></span>
<a name="l00054"></a>00054 <span class="comment">/// Print out debug information to std::cout if BTREE_DEBUG is defined.</span>
<a name="l00055"></a><a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345">00055</a> <span class="comment"></span><span class="preprocessor">#define BTREE_PRINT(x)          do { if (debug) (std::cout &lt;&lt; x &lt;&lt; std::endl); } while(0)</span>
<a name="l00056"></a>00056 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00057"></a>00057 <span class="comment">/// Assertion only if BTREE_DEBUG is defined. This is not used in verify().</span>
<a name="l00058"></a><a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb">00058</a> <span class="comment"></span><span class="preprocessor">#define BTREE_ASSERT(x)         do { assert(x); } while(0)</span>
<a name="l00059"></a>00059 <span class="preprocessor"></span>
<a name="l00060"></a>00060 <span class="preprocessor">#else</span>
<a name="l00061"></a>00061 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00062"></a>00062 <span class="comment">/// Print out debug information to std::cout if BTREE_DEBUG is defined.</span>
<a name="l00063"></a>00063 <span class="comment"></span><span class="preprocessor">#define BTREE_PRINT(x)          do { } while(0)</span>
<a name="l00064"></a>00064 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00065"></a>00065 <span class="comment">/// Assertion only if BTREE_DEBUG is defined. This is not used in verify().</span>
<a name="l00066"></a>00066 <span class="comment"></span><span class="preprocessor">#define BTREE_ASSERT(x)         do { } while(0)</span>
<a name="l00067"></a>00067 <span class="preprocessor"></span>
<a name="l00068"></a>00068 <span class="preprocessor">#endif</span>
<a name="l00069"></a>00069 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00070"></a>00070 <span class="comment">/// The maximum of a and b. Used in some compile-time formulas.</span>
<a name="l00071"></a><a class="code" href="a00026.html#a5d7b0c98bc4c3029d6d76199caa35b19">00071</a> <span class="comment"></span><span class="preprocessor">#define BTREE_MAX(a,b)          ((a) &lt; (b) ? (b) : (a))</span>
<a name="l00072"></a>00072 <span class="preprocessor"></span>
<a name="l00073"></a>00073 <span class="preprocessor">#ifndef BTREE_FRIENDS</span>
<a name="l00074"></a>00074 <span class="preprocessor"></span><span class="comment">/// The macro BTREE_FRIENDS can be used by outside class to access the B+</span>
<a name="l00075"></a>00075 <span class="comment"></span><span class="comment">/// tree internals. This was added for wxBTreeDemo to be able to draw the</span>
<a name="l00076"></a>00076 <span class="comment"></span><span class="comment">/// tree.</span>
<a name="l00077"></a><a class="code" href="a00026.html#aec07a93b351ce398f789007a441a4320">00077</a> <span class="comment"></span><span class="preprocessor">#define BTREE_FRIENDS           friend class btree_friend;</span>
<a name="l00078"></a>00078 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00079"></a>00079 <span class="preprocessor"></span><span class="comment"></span>
<a name="l00080"></a>00080 <span class="comment">/// STX - Some Template Extensions namespace</span>
<a name="l00081"></a><a class="code" href="a00036.html">00081</a> <span class="comment"></span><span class="keyword">namespace </span>stx {
<a name="l00082"></a>00082 <span class="comment"></span>
<a name="l00083"></a>00083 <span class="comment">/** Generates default traits for a B+ tree used as a set. It estimates leaf and</span>
<a name="l00084"></a>00084 <span class="comment"> * inner node sizes by assuming a cache line size of 256 bytes. */</span>
<a name="l00085"></a>00085 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> _Key&gt;
<a name="l00086"></a><a class="code" href="a00003.html">00086</a> <span class="keyword">struct </span><a class="code" href="a00003.html" title="Generates default traits for a B+ tree used as a set.">btree_default_set_traits</a>
<a name="l00087"></a>00087 {<span class="comment"></span>
<a name="l00088"></a>00088 <span class="comment">    /// If true, the tree will self verify it&#39;s invariants after each insert()</span>
<a name="l00089"></a>00089 <span class="comment">    /// or erase(). The header must have been compiled with BTREE_DEBUG defined.</span>
<a name="l00090"></a><a class="code" href="a00003.html#abbb0859c6f7a2b887863011026e28ab1">00090</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span>   <a class="code" href="a00003.html#abbb0859c6f7a2b887863011026e28ab1" title="If true, the tree will self verify it&#39;s invariants after each insert() or erase().">selfverify</a> = <span class="keyword">false</span>;
<a name="l00091"></a>00091 <span class="comment"></span>
<a name="l00092"></a>00092 <span class="comment">    /// If true, the tree will print out debug information and a tree dump</span>
<a name="l00093"></a>00093 <span class="comment">    /// during insert() or erase() operation. The header must have been</span>
<a name="l00094"></a>00094 <span class="comment">    /// compiled with BTREE_DEBUG defined and key_type must be std::ostream</span>
<a name="l00095"></a>00095 <span class="comment">    /// printable.</span>
<a name="l00096"></a><a class="code" href="a00003.html#ab06ff26a50cb57614ddaf1096b2871bb">00096</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span>   <a class="code" href="a00003.html#ab06ff26a50cb57614ddaf1096b2871bb" title="If true, the tree will print out debug information and a tree dump during insert() or erase() operati...">debug</a> = <span class="keyword">false</span>;
<a name="l00097"></a>00097 <span class="comment"></span>
<a name="l00098"></a>00098 <span class="comment">    /// Number of slots in each leaf of the tree. Estimated so that each node</span>
<a name="l00099"></a>00099 <span class="comment">    /// has a size of about 256 bytes.</span>
<a name="l00100"></a><a class="code" href="a00003.html#ab0bbc6a8fdfa17275dab38f5a9c80efc">00100</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span>    <a class="code" href="a00003.html#ab0bbc6a8fdfa17275dab38f5a9c80efc" title="Number of slots in each leaf of the tree.">leafslots</a> = <a class="code" href="a00026.html#a5d7b0c98bc4c3029d6d76199caa35b19" title="The maximum of a and b. Used in some compile-time formulas.">BTREE_MAX</a>( 8, 256 / (<span class="keyword">sizeof</span>(_Key)) );
<a name="l00101"></a>00101 <span class="comment"></span>
<a name="l00102"></a>00102 <span class="comment">    /// Number of slots in each inner node of the tree. Estimated so that each node</span>
<a name="l00103"></a>00103 <span class="comment">    /// has a size of about 256 bytes.</span>
<a name="l00104"></a><a class="code" href="a00003.html#a1a1e1c183cffd510e3fc7e71076bad2b">00104</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span>    <a class="code" href="a00003.html#a1a1e1c183cffd510e3fc7e71076bad2b" title="Number of slots in each inner node of the tree.">innerslots</a> = <a class="code" href="a00026.html#a5d7b0c98bc4c3029d6d76199caa35b19" title="The maximum of a and b. Used in some compile-time formulas.">BTREE_MAX</a>( 8, 256 / (<span class="keyword">sizeof</span>(_Key) + <span class="keyword">sizeof</span>(<span class="keywordtype">void</span>*)) );
<a name="l00105"></a>00105 <span class="comment"></span>
<a name="l00106"></a>00106 <span class="comment">    /// As of stx-btree-0.9, the code does linear search in find_lower() and</span>
<a name="l00107"></a>00107 <span class="comment">    /// find_upper() instead of binary_search, unless the node size is larger</span>
<a name="l00108"></a>00108 <span class="comment">    /// than this threshold. See notes at</span>
<a name="l00109"></a>00109 <span class="comment">    /// http://panthema.net/2013/0504-STX-B+Tree-Binary-vs-Linear-Search</span>
<a name="l00110"></a><a class="code" href="a00003.html#a5f30b3761385f6d26acbd2ad1f91c95a">00110</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code" href="a00003.html#a5f30b3761385f6d26acbd2ad1f91c95a" title="As of stx-btree-0.9, the code does linear search in find_lower() and find_upper() instead of binary_s...">binsearch_threshold</a> = 256;
<a name="l00111"></a>00111 };
<a name="l00112"></a>00112 <span class="comment"></span>
<a name="l00113"></a>00113 <span class="comment">/** Generates default traits for a B+ tree used as a map. It estimates leaf and</span>
<a name="l00114"></a>00114 <span class="comment"> * inner node sizes by assuming a cache line size of 256 bytes. */</span>
<a name="l00115"></a>00115 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Data&gt;
<a name="l00116"></a><a class="code" href="a00002.html">00116</a> <span class="keyword">struct </span><a class="code" href="a00002.html" title="Generates default traits for a B+ tree used as a map.">btree_default_map_traits</a>
<a name="l00117"></a>00117 {<span class="comment"></span>
<a name="l00118"></a>00118 <span class="comment">    /// If true, the tree will self verify it&#39;s invariants after each insert()</span>
<a name="l00119"></a>00119 <span class="comment">    /// or erase(). The header must have been compiled with BTREE_DEBUG defined.</span>
<a name="l00120"></a><a class="code" href="a00002.html#a496dd5b655f8504d804b1751c3b346d4">00120</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span>   <a class="code" href="a00002.html#a496dd5b655f8504d804b1751c3b346d4" title="If true, the tree will self verify it&#39;s invariants after each insert() or erase().">selfverify</a> = <span class="keyword">false</span>;
<a name="l00121"></a>00121 <span class="comment"></span>
<a name="l00122"></a>00122 <span class="comment">    /// If true, the tree will print out debug information and a tree dump</span>
<a name="l00123"></a>00123 <span class="comment">    /// during insert() or erase() operation. The header must have been</span>
<a name="l00124"></a>00124 <span class="comment">    /// compiled with BTREE_DEBUG defined and key_type must be std::ostream</span>
<a name="l00125"></a>00125 <span class="comment">    /// printable.</span>
<a name="l00126"></a><a class="code" href="a00002.html#a89d1e06fd542409800e8b370f9c529dc">00126</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span>   <a class="code" href="a00002.html#a89d1e06fd542409800e8b370f9c529dc" title="If true, the tree will print out debug information and a tree dump during insert() or erase() operati...">debug</a> = <span class="keyword">false</span>;
<a name="l00127"></a>00127 <span class="comment"></span>
<a name="l00128"></a>00128 <span class="comment">    /// Number of slots in each leaf of the tree. Estimated so that each node</span>
<a name="l00129"></a>00129 <span class="comment">    /// has a size of about 256 bytes.</span>
<a name="l00130"></a><a class="code" href="a00002.html#a19d18c5e35448829cc2a62f458d65a4f">00130</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span>    <a class="code" href="a00002.html#a19d18c5e35448829cc2a62f458d65a4f" title="Number of slots in each leaf of the tree.">leafslots</a> = <a class="code" href="a00026.html#a5d7b0c98bc4c3029d6d76199caa35b19" title="The maximum of a and b. Used in some compile-time formulas.">BTREE_MAX</a>( 8, 256 / (<span class="keyword">sizeof</span>(_Key) + <span class="keyword">sizeof</span>(_Data)) );
<a name="l00131"></a>00131 <span class="comment"></span>
<a name="l00132"></a>00132 <span class="comment">    /// Number of slots in each inner node of the tree. Estimated so that each node</span>
<a name="l00133"></a>00133 <span class="comment">    /// has a size of about 256 bytes.</span>
<a name="l00134"></a><a class="code" href="a00002.html#a8fb65e8200dda28ef52fa765e14301ff">00134</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span>    <a class="code" href="a00002.html#a8fb65e8200dda28ef52fa765e14301ff" title="Number of slots in each inner node of the tree.">innerslots</a> = <a class="code" href="a00026.html#a5d7b0c98bc4c3029d6d76199caa35b19" title="The maximum of a and b. Used in some compile-time formulas.">BTREE_MAX</a>( 8, 256 / (<span class="keyword">sizeof</span>(_Key) + <span class="keyword">sizeof</span>(<span class="keywordtype">void</span>*)) );
<a name="l00135"></a>00135 <span class="comment"></span>
<a name="l00136"></a>00136 <span class="comment">    /// As of stx-btree-0.9, the code does linear search in find_lower() and</span>
<a name="l00137"></a>00137 <span class="comment">    /// find_upper() instead of binary_search, unless the node size is larger</span>
<a name="l00138"></a>00138 <span class="comment">    /// than this threshold. See notes at</span>
<a name="l00139"></a>00139 <span class="comment">    /// http://panthema.net/2013/0504-STX-B+Tree-Binary-vs-Linear-Search</span>
<a name="l00140"></a><a class="code" href="a00002.html#ae636c1898e7978b0ca36cebd8fe86319">00140</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> <a class="code" href="a00002.html#ae636c1898e7978b0ca36cebd8fe86319" title="As of stx-btree-0.9, the code does linear search in find_lower() and find_upper() instead of binary_s...">binsearch_threshold</a> = 256;
<a name="l00141"></a>00141 };
<a name="l00142"></a>00142 <span class="comment"></span>
<a name="l00143"></a>00143 <span class="comment">/** @brief Basic class implementing a base B+ tree data structure in memory.</span>
<a name="l00144"></a>00144 <span class="comment"> *</span>
<a name="l00145"></a>00145 <span class="comment"> * The base implementation of a memory B+ tree. It is based on the</span>
<a name="l00146"></a>00146 <span class="comment"> * implementation in Cormen&#39;s Introduction into Algorithms, Jan Jannink&#39;s paper</span>
<a name="l00147"></a>00147 <span class="comment"> * and other algorithm resources. Almost all STL-required function calls are</span>
<a name="l00148"></a>00148 <span class="comment"> * implemented. The asymptotic time requirements of the STL are not always</span>
<a name="l00149"></a>00149 <span class="comment"> * fulfilled in theory, however in practice this B+ tree performs better than a</span>
<a name="l00150"></a>00150 <span class="comment"> * red-black tree by using more memory. The insertion function splits the nodes</span>
<a name="l00151"></a>00151 <span class="comment"> * on the recursion unroll. Erase is largely based on Jannink&#39;s ideas.</span>
<a name="l00152"></a>00152 <span class="comment"> *</span>
<a name="l00153"></a>00153 <span class="comment"> * This class is specialized into btree_set, btree_multiset, btree_map and</span>
<a name="l00154"></a>00154 <span class="comment"> * btree_multimap using default template parameters and facade functions.</span>
<a name="l00155"></a>00155 <span class="comment"> */</span>
<a name="l00156"></a>00156 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> _Key, <span class="keyword">typename</span> _Data,
<a name="l00157"></a>00157           <span class="keyword">typename</span> _Value = std::pair&lt;_Key, _Data&gt;,
<a name="l00158"></a>00158           <span class="keyword">typename</span> _Compare = std::less&lt;_Key&gt;,
<a name="l00159"></a>00159           <span class="keyword">typename</span> _Traits = <a class="code" href="a00002.html" title="Generates default traits for a B+ tree used as a map.">btree_default_map_traits&lt;_Key, _Data&gt;</a>,
<a name="l00160"></a>00160           <span class="keywordtype">bool</span> _Duplicates = <span class="keyword">false</span>,
<a name="l00161"></a>00161           <span class="keyword">typename</span> _Alloc = std::allocator&lt;_Value&gt;,
<a name="l00162"></a>00162           <span class="keywordtype">bool</span> _UsedAsSet = <span class="keyword">false</span> &gt;
<a name="l00163"></a><a class="code" href="a00001.html">00163</a> <span class="keyword">class </span><a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree</a>
<a name="l00164"></a>00164 {
<a name="l00165"></a>00165 <span class="keyword">public</span>:
<a name="l00166"></a>00166     <span class="comment">// *** Template Parameter Types</span>
<a name="l00167"></a>00167 <span class="comment"></span>
<a name="l00168"></a>00168 <span class="comment">    /// First template parameter: The key type of the B+ tree. This is stored</span>
<a name="l00169"></a>00169 <span class="comment">    /// in inner nodes and leaves</span>
<a name="l00170"></a><a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a">00170</a> <span class="comment"></span>    <span class="keyword">typedef</span> _Key                        <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>;
<a name="l00171"></a>00171 <span class="comment"></span>
<a name="l00172"></a>00172 <span class="comment">    /// Second template parameter: The data type associated with each</span>
<a name="l00173"></a>00173 <span class="comment">    /// key. Stored in the B+ tree&#39;s leaves</span>
<a name="l00174"></a><a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616">00174</a> <span class="comment"></span>    <span class="keyword">typedef</span> _Data                       <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">data_type</a>;
<a name="l00175"></a>00175 <span class="comment"></span>
<a name="l00176"></a>00176 <span class="comment">    /// Third template parameter: Composition pair of key and data types, this</span>
<a name="l00177"></a>00177 <span class="comment">    /// is required by the STL standard. The B+ tree does not store key and</span>
<a name="l00178"></a>00178 <span class="comment">    /// data together. If value_type == key_type then the B+ tree implements a</span>
<a name="l00179"></a>00179 <span class="comment">    /// set.</span>
<a name="l00180"></a><a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6">00180</a> <span class="comment"></span>    <span class="keyword">typedef</span> _Value                      <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">value_type</a>;
<a name="l00181"></a>00181 <span class="comment"></span>
<a name="l00182"></a>00182 <span class="comment">    /// Fourth template parameter: Key comparison function object</span>
<a name="l00183"></a><a class="code" href="a00001.html#a71413b8b8a1440539691a97f4cb61cae">00183</a> <span class="comment"></span>    <span class="keyword">typedef</span> _Compare                    <a class="code" href="a00001.html#a71413b8b8a1440539691a97f4cb61cae" title="Fourth template parameter: Key comparison function object.">key_compare</a>;
<a name="l00184"></a>00184 <span class="comment"></span>
<a name="l00185"></a>00185 <span class="comment">    /// Fifth template parameter: Traits object used to define more parameters</span>
<a name="l00186"></a>00186 <span class="comment">    /// of the B+ tree</span>
<a name="l00187"></a><a class="code" href="a00001.html#a8b13a0eb2e558d11830d38de21b82319">00187</a> <span class="comment"></span>    <span class="keyword">typedef</span> _Traits                     <a class="code" href="a00001.html#a8b13a0eb2e558d11830d38de21b82319" title="Fifth template parameter: Traits object used to define more parameters of the B+ tree.">traits</a>;
<a name="l00188"></a>00188 <span class="comment"></span>
<a name="l00189"></a>00189 <span class="comment">    /// Sixth template parameter: Allow duplicate keys in the B+ tree. Used to</span>
<a name="l00190"></a>00190 <span class="comment">    /// implement multiset and multimap.</span>
<a name="l00191"></a><a class="code" href="a00001.html#acd41575a35d1c5d55e955aafc9762454">00191</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span>                   <a class="code" href="a00001.html#acd41575a35d1c5d55e955aafc9762454" title="Sixth template parameter: Allow duplicate keys in the B+ tree.">allow_duplicates</a> = _Duplicates;
<a name="l00192"></a>00192 <span class="comment"></span>
<a name="l00193"></a>00193 <span class="comment">    /// Seventh template parameter: STL allocator for tree nodes</span>
<a name="l00194"></a><a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b">00194</a> <span class="comment"></span>    <span class="keyword">typedef</span> _Alloc                      <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a>;
<a name="l00195"></a>00195 <span class="comment"></span>
<a name="l00196"></a>00196 <span class="comment">    /// Eighth template parameter: boolean indicator whether the btree is used</span>
<a name="l00197"></a>00197 <span class="comment">    /// as a set. In this case all operations on the data arrays are</span>
<a name="l00198"></a>00198 <span class="comment">    /// omitted. This flag is kind of hacky, but required because</span>
<a name="l00199"></a>00199 <span class="comment">    /// sizeof(empty_struct) = 1 due to the C standard. Without the flag, lots</span>
<a name="l00200"></a>00200 <span class="comment">    /// of superfluous copying would occur.</span>
<a name="l00201"></a><a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023">00201</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span>                   <a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a> = _UsedAsSet;
<a name="l00202"></a>00202 
<a name="l00203"></a>00203     <span class="comment">// The macro BTREE_FRIENDS can be used by outside class to access the B+</span>
<a name="l00204"></a>00204     <span class="comment">// tree internals. This was added for wxBTreeDemo to be able to draw the</span>
<a name="l00205"></a>00205     <span class="comment">// tree.</span>
<a name="l00206"></a>00206     <a class="code" href="a00026.html#aec07a93b351ce398f789007a441a4320" title="The macro BTREE_FRIENDS can be used by outside class to access the B+ tree internals.">BTREE_FRIENDS</a>
<a name="l00207"></a>00207 
<a name="l00208"></a>00208 <span class="keyword">public</span>:
<a name="l00209"></a>00209     <span class="comment">// *** Constructed Types</span>
<a name="l00210"></a>00210 <span class="comment"></span>
<a name="l00211"></a>00211 <span class="comment">    /// Typedef of our own type</span>
<a name="l00212"></a>00212 <span class="comment"></span>    <span class="keyword">typedef</span> <a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree</a>&lt;<a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>, <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">data_type</a>, <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">value_type</a>, <a class="code" href="a00001.html#a71413b8b8a1440539691a97f4cb61cae" title="Fourth template parameter: Key comparison function object.">key_compare</a>,
<a name="l00213"></a><a class="code" href="a00001.html#ad7844e40add49f90fc9e1f2c888afb14">00213</a>                   <a class="code" href="a00001.html#a8b13a0eb2e558d11830d38de21b82319" title="Fifth template parameter: Traits object used to define more parameters of the B+ tree.">traits</a>, <a class="code" href="a00001.html#acd41575a35d1c5d55e955aafc9762454" title="Sixth template parameter: Allow duplicate keys in the B+ tree.">allow_duplicates</a>, <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a>, <a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a>&gt; <a class="code" href="a00001.html#ad7844e40add49f90fc9e1f2c888afb14" title="Typedef of our own type.">btree_self</a>;
<a name="l00214"></a>00214 <span class="comment"></span>
<a name="l00215"></a>00215 <span class="comment">    /// Size type used to count keys</span>
<a name="l00216"></a><a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da">00216</a> <span class="comment"></span>    <span class="keyword">typedef</span> <span class="keywordtype">size_t</span>                              <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a>;
<a name="l00217"></a>00217 <span class="comment"></span>
<a name="l00218"></a>00218 <span class="comment">    /// The pair of key_type and data_type, this may be different from value_type.</span>
<a name="l00219"></a><a class="code" href="a00001.html#a2cddd431e50047766f45902b9f6f5c31">00219</a> <span class="comment"></span>    <span class="keyword">typedef</span> std::pair&lt;key_type, data_type&gt;      <a class="code" href="a00001.html#a2cddd431e50047766f45902b9f6f5c31" title="The pair of key_type and data_type, this may be different from value_type.">pair_type</a>;
<a name="l00220"></a>00220 
<a name="l00221"></a>00221 <span class="keyword">public</span>:
<a name="l00222"></a>00222     <span class="comment">// *** Static Constant Options and Values of the B+ Tree</span>
<a name="l00223"></a>00223 <span class="comment"></span>
<a name="l00224"></a>00224 <span class="comment">    /// Base B+ tree parameter: The number of key/data slots in each leaf</span>
<a name="l00225"></a><a class="code" href="a00001.html#ac6c274f39fce8e14f6a881fc1da39cf8">00225</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>         <a class="code" href="a00001.html#ac6c274f39fce8e14f6a881fc1da39cf8" title="Base B+ tree parameter: The number of key/data slots in each leaf.">leafslotmax</a> =  traits::leafslots;
<a name="l00226"></a>00226 <span class="comment"></span>
<a name="l00227"></a>00227 <span class="comment">    /// Base B+ tree parameter: The number of key slots in each inner node,</span>
<a name="l00228"></a>00228 <span class="comment">    /// this can differ from slots in each leaf.</span>
<a name="l00229"></a><a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0">00229</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>         <a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">innerslotmax</a> =  traits::innerslots;
<a name="l00230"></a>00230 <span class="comment"></span>
<a name="l00231"></a>00231 <span class="comment">    /// Computed B+ tree parameter: The minimum number of key/data slots used</span>
<a name="l00232"></a>00232 <span class="comment">    /// in a leaf. If fewer slots are used, the leaf will be merged or slots</span>
<a name="l00233"></a>00233 <span class="comment">    /// shifted from it&#39;s siblings.</span>
<a name="l00234"></a><a class="code" href="a00001.html#ad8525611bf3b079ca4ab13dbab9b23c0">00234</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> <a class="code" href="a00001.html#ad8525611bf3b079ca4ab13dbab9b23c0" title="Computed B+ tree parameter: The minimum number of key/data slots used in a leaf.">minleafslots</a> = (<a class="code" href="a00001.html#ac6c274f39fce8e14f6a881fc1da39cf8" title="Base B+ tree parameter: The number of key/data slots in each leaf.">leafslotmax</a> / 2);
<a name="l00235"></a>00235 <span class="comment"></span>
<a name="l00236"></a>00236 <span class="comment">    /// Computed B+ tree parameter: The minimum number of key slots used</span>
<a name="l00237"></a>00237 <span class="comment">    /// in an inner node. If fewer slots are used, the inner node will be</span>
<a name="l00238"></a>00238 <span class="comment">    /// merged or slots shifted from it&#39;s siblings.</span>
<a name="l00239"></a><a class="code" href="a00001.html#aefbcc95b60d5bae8dd7ba9c25e5b6654">00239</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> <a class="code" href="a00001.html#aefbcc95b60d5bae8dd7ba9c25e5b6654" title="Computed B+ tree parameter: The minimum number of key slots used in an inner node.">mininnerslots</a> = (<a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">innerslotmax</a> / 2);
<a name="l00240"></a>00240 <span class="comment"></span>
<a name="l00241"></a>00241 <span class="comment">    /// Debug parameter: Enables expensive and thorough checking of the B+ tree</span>
<a name="l00242"></a>00242 <span class="comment">    /// invariants after each insert/erase operation.</span>
<a name="l00243"></a><a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae">00243</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span>                   <a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a> = <a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">traits::selfverify</a>;
<a name="l00244"></a>00244 <span class="comment"></span>
<a name="l00245"></a>00245 <span class="comment">    /// Debug parameter: Prints out lots of debug information about how the</span>
<a name="l00246"></a>00246 <span class="comment">    /// algorithms change the tree. Requires the header file to be compiled</span>
<a name="l00247"></a>00247 <span class="comment">    /// with BTREE_DEBUG and the key type must be std::ostream printable.</span>
<a name="l00248"></a><a class="code" href="a00001.html#a224f31a88d50490e14f0f291d70ef2fc">00248</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span>                   <a class="code" href="a00001.html#a224f31a88d50490e14f0f291d70ef2fc" title="Debug parameter: Prints out lots of debug information about how the algorithms change the tree...">debug</a> = <a class="code" href="a00001.html#a224f31a88d50490e14f0f291d70ef2fc" title="Debug parameter: Prints out lots of debug information about how the algorithms change the tree...">traits::debug</a>;
<a name="l00249"></a>00249 
<a name="l00250"></a>00250 <span class="keyword">private</span>:
<a name="l00251"></a>00251     <span class="comment">// *** Node Classes for In-Memory Nodes</span>
<a name="l00252"></a>00252 <span class="comment"></span>
<a name="l00253"></a>00253 <span class="comment">    /// The header structure of each node in-memory. This structure is extended</span>
<a name="l00254"></a>00254 <span class="comment">    /// by inner_node or leaf_node.</span>
<a name="l00255"></a><a class="code" href="a00018.html">00255</a> <span class="comment"></span>    <span class="keyword">struct </span><a class="code" href="a00018.html" title="The header structure of each node in-memory.">node</a>
<a name="l00256"></a>00256     {<span class="comment"></span>
<a name="l00257"></a>00257 <span class="comment">        /// Level in the b-tree, if level == 0 -&gt; leaf node</span>
<a name="l00258"></a><a class="code" href="a00018.html#a9204f647e868560552dddc001aac8a55">00258</a> <span class="comment"></span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>  <a class="code" href="a00018.html#a9204f647e868560552dddc001aac8a55" title="Level in the b-tree, if level == 0 -&gt; leaf node.">level</a>;
<a name="l00259"></a>00259 <span class="comment"></span>
<a name="l00260"></a>00260 <span class="comment">        /// Number of key slotuse use, so number of valid children or data</span>
<a name="l00261"></a>00261 <span class="comment">        /// pointers</span>
<a name="l00262"></a><a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903">00262</a> <span class="comment"></span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>  <a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l00263"></a>00263 <span class="comment"></span>
<a name="l00264"></a>00264 <span class="comment">        /// Delayed initialisation of constructed node</span>
<a name="l00265"></a><a class="code" href="a00018.html#a5fdccd9e010dc73398fb0694ed803d38">00265</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="a00018.html#a5fdccd9e010dc73398fb0694ed803d38" title="Delayed initialisation of constructed node.">initialize</a>(<span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> l)
<a name="l00266"></a>00266         {
<a name="l00267"></a>00267             <a class="code" href="a00018.html#a9204f647e868560552dddc001aac8a55" title="Level in the b-tree, if level == 0 -&gt; leaf node.">level</a> = l;
<a name="l00268"></a>00268             <a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> = 0;
<a name="l00269"></a>00269         }
<a name="l00270"></a>00270 <span class="comment"></span>
<a name="l00271"></a>00271 <span class="comment">        /// True if this is a leaf node</span>
<a name="l00272"></a><a class="code" href="a00018.html#aaf1681ee7b53dffc6a3a7ef0a865f83b">00272</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00018.html#aaf1681ee7b53dffc6a3a7ef0a865f83b" title="True if this is a leaf node.">isleafnode</a>()<span class="keyword"> const</span>
<a name="l00273"></a>00273 <span class="keyword">        </span>{
<a name="l00274"></a>00274             <span class="keywordflow">return</span> (<a class="code" href="a00018.html#a9204f647e868560552dddc001aac8a55" title="Level in the b-tree, if level == 0 -&gt; leaf node.">level</a> == 0);
<a name="l00275"></a>00275         }
<a name="l00276"></a>00276     };
<a name="l00277"></a>00277 <span class="comment"></span>
<a name="l00278"></a>00278 <span class="comment">    /// Extended structure of a inner node in-memory. Contains only keys and no</span>
<a name="l00279"></a>00279 <span class="comment">    /// data items.</span>
<a name="l00280"></a><a class="code" href="a00015.html">00280</a> <span class="comment"></span>    <span class="keyword">struct </span><a class="code" href="a00015.html" title="Extended structure of a inner node in-memory.">inner_node</a> : <span class="keyword">public</span> <a class="code" href="a00018.html" title="The header structure of each node in-memory.">node</a>
<a name="l00281"></a>00281     {<span class="comment"></span>
<a name="l00282"></a>00282 <span class="comment">        /// Define an related allocator for the inner_node structs.</span>
<a name="l00283"></a><a class="code" href="a00015.html#a0d8b919b9db1069387e966ae4b39c1b5">00283</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::template rebind&lt;inner_node&gt;::other <a class="code" href="a00015.html#a0d8b919b9db1069387e966ae4b39c1b5" title="Define an related allocator for the inner_node structs.">alloc_type</a>;
<a name="l00284"></a>00284 <span class="comment"></span>
<a name="l00285"></a>00285 <span class="comment">        /// Keys of children or data pointers</span>
<a name="l00286"></a><a class="code" href="a00015.html#ac78e5fb3be9571b04e97bd89c6aa22ee">00286</a> <span class="comment"></span>        <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>        <a class="code" href="a00015.html#ac78e5fb3be9571b04e97bd89c6aa22ee" title="Keys of children or data pointers.">slotkey</a>[<a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">innerslotmax</a>];
<a name="l00287"></a>00287 <span class="comment"></span>
<a name="l00288"></a>00288 <span class="comment">        /// Pointers to children</span>
<a name="l00289"></a><a class="code" href="a00015.html#ab573f6af3036dbc374c8914b61bdd2ec">00289</a> <span class="comment"></span>        <a class="code" href="a00018.html" title="The header structure of each node in-memory.">node</a>*           <a class="code" href="a00015.html#ab573f6af3036dbc374c8914b61bdd2ec" title="Pointers to children.">childid</a>[<a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">innerslotmax</a>+1];
<a name="l00290"></a>00290 <span class="comment"></span>
<a name="l00291"></a>00291 <span class="comment">        /// Set variables to initial values</span>
<a name="l00292"></a><a class="code" href="a00015.html#ae10027d02927a1c8c2303a419197078c">00292</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="a00015.html#ae10027d02927a1c8c2303a419197078c" title="Set variables to initial values.">initialize</a>(<span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> l)
<a name="l00293"></a>00293         {
<a name="l00294"></a>00294             <a class="code" href="a00015.html#ae10027d02927a1c8c2303a419197078c" title="Set variables to initial values.">node::initialize</a>(l);
<a name="l00295"></a>00295         }
<a name="l00296"></a>00296 <span class="comment"></span>
<a name="l00297"></a>00297 <span class="comment">        /// True if the node&#39;s slots are full</span>
<a name="l00298"></a><a class="code" href="a00015.html#ac046992e9d115a4c02079f58f8aff124">00298</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00015.html#ac046992e9d115a4c02079f58f8aff124" title="True if the node&#39;s slots are full.">isfull</a>()<span class="keyword"> const</span>
<a name="l00299"></a>00299 <span class="keyword">        </span>{
<a name="l00300"></a>00300             <span class="keywordflow">return</span> (<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">node::slotuse</a> == <a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">innerslotmax</a>);
<a name="l00301"></a>00301         }
<a name="l00302"></a>00302 <span class="comment"></span>
<a name="l00303"></a>00303 <span class="comment">        /// True if few used entries, less than half full</span>
<a name="l00304"></a><a class="code" href="a00015.html#ad1f041a8a15ebbca6d88f4819cc5e179">00304</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00015.html#ad1f041a8a15ebbca6d88f4819cc5e179" title="True if few used entries, less than half full.">isfew</a>()<span class="keyword"> const</span>
<a name="l00305"></a>00305 <span class="keyword">        </span>{
<a name="l00306"></a>00306             <span class="keywordflow">return</span> (<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">node::slotuse</a> &lt;= <a class="code" href="a00001.html#aefbcc95b60d5bae8dd7ba9c25e5b6654" title="Computed B+ tree parameter: The minimum number of key slots used in an inner node.">mininnerslots</a>);
<a name="l00307"></a>00307         }
<a name="l00308"></a>00308 <span class="comment"></span>
<a name="l00309"></a>00309 <span class="comment">        /// True if node has too few entries</span>
<a name="l00310"></a><a class="code" href="a00015.html#aa5aea58745f1e12404802e0dd6863656">00310</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00015.html#aa5aea58745f1e12404802e0dd6863656" title="True if node has too few entries.">isunderflow</a>()<span class="keyword"> const</span>
<a name="l00311"></a>00311 <span class="keyword">        </span>{
<a name="l00312"></a>00312             <span class="keywordflow">return</span> (<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">node::slotuse</a> &lt; <a class="code" href="a00001.html#aefbcc95b60d5bae8dd7ba9c25e5b6654" title="Computed B+ tree parameter: The minimum number of key slots used in an inner node.">mininnerslots</a>);
<a name="l00313"></a>00313         }
<a name="l00314"></a>00314     };
<a name="l00315"></a>00315 <span class="comment"></span>
<a name="l00316"></a>00316 <span class="comment">    /// Extended structure of a leaf node in memory. Contains pairs of keys and</span>
<a name="l00317"></a>00317 <span class="comment">    /// data items. Key and data slots are kept in separate arrays, because the</span>
<a name="l00318"></a>00318 <span class="comment">    /// key array is traversed very often compared to accessing the data items.</span>
<a name="l00319"></a><a class="code" href="a00017.html">00319</a> <span class="comment"></span>    <span class="keyword">struct </span><a class="code" href="a00017.html" title="Extended structure of a leaf node in memory.">leaf_node</a> : <span class="keyword">public</span> <a class="code" href="a00018.html" title="The header structure of each node in-memory.">node</a>
<a name="l00320"></a>00320     {<span class="comment"></span>
<a name="l00321"></a>00321 <span class="comment">        /// Define an related allocator for the leaf_node structs.</span>
<a name="l00322"></a><a class="code" href="a00017.html#a99d5a3d40c5098a75bbcb9404971e4fd">00322</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> _Alloc::template rebind&lt;leaf_node&gt;::other <a class="code" href="a00017.html#a99d5a3d40c5098a75bbcb9404971e4fd" title="Define an related allocator for the leaf_node structs.">alloc_type</a>;
<a name="l00323"></a>00323 <span class="comment"></span>
<a name="l00324"></a>00324 <span class="comment">        /// Double linked list pointers to traverse the leaves</span>
<a name="l00325"></a><a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000">00325</a> <span class="comment"></span>        <a class="code" href="a00017.html" title="Extended structure of a leaf node in memory.">leaf_node</a>       *<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a>;
<a name="l00326"></a>00326 <span class="comment"></span>
<a name="l00327"></a>00327 <span class="comment">        /// Double linked list pointers to traverse the leaves</span>
<a name="l00328"></a><a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367">00328</a> <span class="comment"></span>        <a class="code" href="a00017.html" title="Extended structure of a leaf node in memory.">leaf_node</a>       *<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a>;
<a name="l00329"></a>00329 <span class="comment"></span>
<a name="l00330"></a>00330 <span class="comment">        /// Keys of children or data pointers</span>
<a name="l00331"></a><a class="code" href="a00017.html#af92e519f605cf7b7aae74f6f5d6c8bd8">00331</a> <span class="comment"></span>        <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>        <a class="code" href="a00017.html#af92e519f605cf7b7aae74f6f5d6c8bd8" title="Keys of children or data pointers.">slotkey</a>[<a class="code" href="a00001.html#ac6c274f39fce8e14f6a881fc1da39cf8" title="Base B+ tree parameter: The number of key/data slots in each leaf.">leafslotmax</a>];
<a name="l00332"></a>00332 <span class="comment"></span>
<a name="l00333"></a>00333 <span class="comment">        /// Array of data</span>
<a name="l00334"></a><a class="code" href="a00017.html#ad4fc245fe5b90c21dec069792c3f7432">00334</a> <span class="comment"></span>        <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">data_type</a>       <a class="code" href="a00017.html#ad4fc245fe5b90c21dec069792c3f7432" title="Array of data.">slotdata</a>[<a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a> ? 1 : <a class="code" href="a00001.html#ac6c274f39fce8e14f6a881fc1da39cf8" title="Base B+ tree parameter: The number of key/data slots in each leaf.">leafslotmax</a>];
<a name="l00335"></a>00335 <span class="comment"></span>
<a name="l00336"></a>00336 <span class="comment">        /// Set variables to initial values</span>
<a name="l00337"></a><a class="code" href="a00017.html#a3db9141d0f1335ebaacb141ab6eef0d1">00337</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="a00017.html#a3db9141d0f1335ebaacb141ab6eef0d1" title="Set variables to initial values.">initialize</a>()
<a name="l00338"></a>00338         {
<a name="l00339"></a>00339             <a class="code" href="a00017.html#a3db9141d0f1335ebaacb141ab6eef0d1" title="Set variables to initial values.">node::initialize</a>(0);
<a name="l00340"></a>00340             <a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> = <a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a> = NULL;
<a name="l00341"></a>00341         }
<a name="l00342"></a>00342 <span class="comment"></span>
<a name="l00343"></a>00343 <span class="comment">        /// True if the node&#39;s slots are full</span>
<a name="l00344"></a><a class="code" href="a00017.html#a5f6015492b1e10183eef8a60a33680f4">00344</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00017.html#a5f6015492b1e10183eef8a60a33680f4" title="True if the node&#39;s slots are full.">isfull</a>()<span class="keyword"> const</span>
<a name="l00345"></a>00345 <span class="keyword">        </span>{
<a name="l00346"></a>00346             <span class="keywordflow">return</span> (<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">node::slotuse</a> == <a class="code" href="a00001.html#ac6c274f39fce8e14f6a881fc1da39cf8" title="Base B+ tree parameter: The number of key/data slots in each leaf.">leafslotmax</a>);
<a name="l00347"></a>00347         }
<a name="l00348"></a>00348 <span class="comment"></span>
<a name="l00349"></a>00349 <span class="comment">        /// True if few used entries, less than half full</span>
<a name="l00350"></a><a class="code" href="a00017.html#a5dd4c34fed677676beaf1782ee4a873f">00350</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00017.html#a5dd4c34fed677676beaf1782ee4a873f" title="True if few used entries, less than half full.">isfew</a>()<span class="keyword"> const</span>
<a name="l00351"></a>00351 <span class="keyword">        </span>{
<a name="l00352"></a>00352             <span class="keywordflow">return</span> (<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">node::slotuse</a> &lt;= <a class="code" href="a00001.html#ad8525611bf3b079ca4ab13dbab9b23c0" title="Computed B+ tree parameter: The minimum number of key/data slots used in a leaf.">minleafslots</a>);
<a name="l00353"></a>00353         }
<a name="l00354"></a>00354 <span class="comment"></span>
<a name="l00355"></a>00355 <span class="comment">        /// True if node has too few entries</span>
<a name="l00356"></a><a class="code" href="a00017.html#acb0129f5abf7dafb3d802b7ea25b418c">00356</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00017.html#acb0129f5abf7dafb3d802b7ea25b418c" title="True if node has too few entries.">isunderflow</a>()<span class="keyword"> const</span>
<a name="l00357"></a>00357 <span class="keyword">        </span>{
<a name="l00358"></a>00358             <span class="keywordflow">return</span> (<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">node::slotuse</a> &lt; <a class="code" href="a00001.html#ad8525611bf3b079ca4ab13dbab9b23c0" title="Computed B+ tree parameter: The minimum number of key/data slots used in a leaf.">minleafslots</a>);
<a name="l00359"></a>00359         }
<a name="l00360"></a>00360 <span class="comment"></span>
<a name="l00361"></a>00361 <span class="comment">        /// Set the (key,data) pair in slot. Overloaded function used by</span>
<a name="l00362"></a>00362 <span class="comment">        /// bulk_load().</span>
<a name="l00363"></a><a class="code" href="a00017.html#ab93769e06b9644f7f4c47416d59d312c">00363</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="a00017.html#ab93769e06b9644f7f4c47416d59d312c" title="Set the (key,data) pair in slot.">set_slot</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> slot, <span class="keyword">const</span> <a class="code" href="a00001.html#a2cddd431e50047766f45902b9f6f5c31" title="The pair of key_type and data_type, this may be different from value_type.">pair_type</a>&amp; value)
<a name="l00364"></a>00364         {
<a name="l00365"></a>00365             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a> == <span class="keyword">false</span>);
<a name="l00366"></a>00366             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(slot &lt; <a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">node::slotuse</a>);
<a name="l00367"></a>00367             <a class="code" href="a00017.html#af92e519f605cf7b7aae74f6f5d6c8bd8" title="Keys of children or data pointers.">slotkey</a>[slot] = value.first;
<a name="l00368"></a>00368             <a class="code" href="a00017.html#ad4fc245fe5b90c21dec069792c3f7432" title="Array of data.">slotdata</a>[slot] = value.second;
<a name="l00369"></a>00369         }
<a name="l00370"></a>00370 <span class="comment"></span>
<a name="l00371"></a>00371 <span class="comment">        /// Set the key pair in slot. Overloaded function used by</span>
<a name="l00372"></a>00372 <span class="comment">        /// bulk_load().</span>
<a name="l00373"></a><a class="code" href="a00017.html#a3b2b782408d619ef8d0496930343015d">00373</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="a00017.html#ab93769e06b9644f7f4c47416d59d312c" title="Set the (key,data) pair in slot.">set_slot</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> slot, <span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key)
<a name="l00374"></a>00374         {
<a name="l00375"></a>00375             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a> == <span class="keyword">true</span>);
<a name="l00376"></a>00376             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(slot &lt; <a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">node::slotuse</a>);
<a name="l00377"></a>00377             <a class="code" href="a00017.html#af92e519f605cf7b7aae74f6f5d6c8bd8" title="Keys of children or data pointers.">slotkey</a>[slot] = key;
<a name="l00378"></a>00378         }
<a name="l00379"></a>00379     };
<a name="l00380"></a>00380 
<a name="l00381"></a>00381 <span class="keyword">private</span>:
<a name="l00382"></a>00382     <span class="comment">// *** Template Magic to Convert a pair or key/data types to a value_type</span>
<a name="l00383"></a>00383 <span class="comment"></span>
<a name="l00384"></a>00384 <span class="comment">    /// For sets the second pair_type is an empty struct, so the value_type</span>
<a name="l00385"></a>00385 <span class="comment">    /// should only be the first.</span>
<a name="l00386"></a>00386 <span class="comment"></span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> value_type, <span class="keyword">typename</span> pair_type&gt;
<a name="l00387"></a><a class="code" href="a00007.html">00387</a>     <span class="keyword">struct </span><a class="code" href="a00007.html" title="For sets the second pair_type is an empty struct, so the value_type should only be the first...">btree_pair_to_value</a>
<a name="l00388"></a>00388     {<span class="comment"></span>
<a name="l00389"></a>00389 <span class="comment">        /// Convert a fake pair type to just the first component</span>
<a name="l00390"></a><a class="code" href="a00007.html#adf06d39520a423a4a5de3982753025c3">00390</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">value_type</a> <a class="code" href="a00007.html#adf06d39520a423a4a5de3982753025c3" title="Convert a fake pair type to just the first component.">operator()</a>(<a class="code" href="a00001.html#a2cddd431e50047766f45902b9f6f5c31" title="The pair of key_type and data_type, this may be different from value_type.">pair_type</a>&amp; p)<span class="keyword"> const </span>{
<a name="l00391"></a>00391             <span class="keywordflow">return</span> p.first;
<a name="l00392"></a>00392         }<span class="comment"></span>
<a name="l00393"></a>00393 <span class="comment">        /// Convert a fake pair type to just the first component</span>
<a name="l00394"></a><a class="code" href="a00007.html#a1cac939fc310be496b995ae11d7056d8">00394</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">value_type</a> <a class="code" href="a00007.html#a1cac939fc310be496b995ae11d7056d8" title="Convert a fake pair type to just the first component.">operator()</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a2cddd431e50047766f45902b9f6f5c31" title="The pair of key_type and data_type, this may be different from value_type.">pair_type</a>&amp; p)<span class="keyword"> const </span>{
<a name="l00395"></a>00395             <span class="keywordflow">return</span> p.first;
<a name="l00396"></a>00396         }
<a name="l00397"></a>00397     };
<a name="l00398"></a>00398 <span class="comment"></span>
<a name="l00399"></a>00399 <span class="comment">    /// For maps value_type is the same as the pair_type</span>
<a name="l00400"></a>00400 <span class="comment"></span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> value_type&gt;
<a name="l00401"></a><a class="code" href="a00008.html">00401</a>     <span class="keyword">struct </span><a class="code" href="a00007.html" title="For sets the second pair_type is an empty struct, so the value_type should only be the first...">btree_pair_to_value</a>&lt;<a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">value_type</a>, <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">value_type</a>&gt;
<a name="l00402"></a>00402     {<span class="comment"></span>
<a name="l00403"></a>00403 <span class="comment">        /// Identity &quot;convert&quot; a real pair type to just the first component</span>
<a name="l00404"></a><a class="code" href="a00008.html#a95aefcd10d430360cbdeb2cddb04bfcd">00404</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">value_type</a> <a class="code" href="a00008.html#a95aefcd10d430360cbdeb2cddb04bfcd" title="Identity &quot;convert&quot; a real pair type to just the first component.">operator()</a>(<a class="code" href="a00001.html#a2cddd431e50047766f45902b9f6f5c31" title="The pair of key_type and data_type, this may be different from value_type.">pair_type</a>&amp; p)<span class="keyword"> const </span>{
<a name="l00405"></a>00405             <span class="keywordflow">return</span> p;
<a name="l00406"></a>00406         }<span class="comment"></span>
<a name="l00407"></a>00407 <span class="comment">        /// Identity &quot;convert&quot; a real pair type to just the first component</span>
<a name="l00408"></a><a class="code" href="a00008.html#a0d3e61d7f25f9de525f295ad24a85140">00408</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">value_type</a> <a class="code" href="a00008.html#a0d3e61d7f25f9de525f295ad24a85140" title="Identity &quot;convert&quot; a real pair type to just the first component.">operator()</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a2cddd431e50047766f45902b9f6f5c31" title="The pair of key_type and data_type, this may be different from value_type.">pair_type</a>&amp; p)<span class="keyword"> const </span>{
<a name="l00409"></a>00409             <span class="keywordflow">return</span> p;
<a name="l00410"></a>00410         }
<a name="l00411"></a>00411     };
<a name="l00412"></a>00412 <span class="comment"></span>
<a name="l00413"></a>00413 <span class="comment">    /// Using template specialization select the correct converter used by the</span>
<a name="l00414"></a>00414 <span class="comment">    /// iterators</span>
<a name="l00415"></a><a class="code" href="a00001.html#a76bd9fc84f712e0d962314c1d6a188ce">00415</a> <span class="comment"></span>    <span class="keyword">typedef</span> btree_pair_to_value&lt;value_type, pair_type&gt; <a class="code" href="a00001.html#a76bd9fc84f712e0d962314c1d6a188ce" title="Using template specialization select the correct converter used by the iterators.">pair_to_value_type</a>;
<a name="l00416"></a>00416 
<a name="l00417"></a>00417 <span class="keyword">public</span>:
<a name="l00418"></a>00418     <span class="comment">// *** Iterators and Reverse Iterators</span>
<a name="l00419"></a>00419 
<a name="l00420"></a>00420     <span class="keyword">class </span>iterator;
<a name="l00421"></a>00421     <span class="keyword">class </span>const_iterator;
<a name="l00422"></a>00422     <span class="keyword">class </span>reverse_iterator;
<a name="l00423"></a>00423     <span class="keyword">class </span>const_reverse_iterator;
<a name="l00424"></a>00424 <span class="comment"></span>
<a name="l00425"></a>00425 <span class="comment">    /// STL-like iterator object for B+ tree items. The iterator points to a</span>
<a name="l00426"></a>00426 <span class="comment">    /// specific slot number in a leaf.</span>
<a name="l00427"></a><a class="code" href="a00016.html">00427</a> <span class="comment"></span>    <span class="keyword">class </span><a class="code" href="a00016.html" title="STL-like iterator object for B+ tree items.">iterator</a>
<a name="l00428"></a>00428     {
<a name="l00429"></a>00429     <span class="keyword">public</span>:
<a name="l00430"></a>00430         <span class="comment">// *** Types</span>
<a name="l00431"></a>00431 <span class="comment"></span>
<a name="l00432"></a>00432 <span class="comment">        /// The key type of the btree. Returned by key().</span>
<a name="l00433"></a><a class="code" href="a00016.html#a8b03fc63a85738411711197143596475">00433</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">btree::key_type</a>                <a class="code" href="a00016.html#a8b03fc63a85738411711197143596475" title="The key type of the btree. Returned by key().">key_type</a>;
<a name="l00434"></a>00434 <span class="comment"></span>
<a name="l00435"></a>00435 <span class="comment">        /// The data type of the btree. Returned by data().</span>
<a name="l00436"></a><a class="code" href="a00016.html#ac28707a6e23e871cb85c7ff7f8119c73">00436</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">btree::data_type</a>               <a class="code" href="a00016.html#ac28707a6e23e871cb85c7ff7f8119c73" title="The data type of the btree. Returned by data().">data_type</a>;
<a name="l00437"></a>00437 <span class="comment"></span>
<a name="l00438"></a>00438 <span class="comment">        /// The value type of the btree. Returned by operator*().</span>
<a name="l00439"></a><a class="code" href="a00016.html#a3ca0d6f7760b4aa78ff47e53e82d7e1f">00439</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">btree::value_type</a>              <a class="code" href="a00016.html#a3ca0d6f7760b4aa78ff47e53e82d7e1f" title="The value type of the btree. Returned by operator*().">value_type</a>;
<a name="l00440"></a>00440 <span class="comment"></span>
<a name="l00441"></a>00441 <span class="comment">        /// The pair type of the btree.</span>
<a name="l00442"></a><a class="code" href="a00016.html#a2b722e1077949a356115387bfd606d63">00442</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#a2cddd431e50047766f45902b9f6f5c31" title="The pair of key_type and data_type, this may be different from value_type.">btree::pair_type</a>               <a class="code" href="a00016.html#a2b722e1077949a356115387bfd606d63" title="The pair type of the btree.">pair_type</a>;
<a name="l00443"></a>00443 <span class="comment"></span>
<a name="l00444"></a>00444 <span class="comment">        /// Reference to the value_type. STL required.</span>
<a name="l00445"></a><a class="code" href="a00016.html#ae1af55705fdbcf4a78144fbd6b3df028">00445</a> <span class="comment"></span>        <span class="keyword">typedef</span> <a class="code" href="a00016.html#a3ca0d6f7760b4aa78ff47e53e82d7e1f" title="The value type of the btree. Returned by operator*().">value_type</a>&amp;             <a class="code" href="a00016.html#ae1af55705fdbcf4a78144fbd6b3df028" title="Reference to the value_type. STL required.">reference</a>;
<a name="l00446"></a>00446 <span class="comment"></span>
<a name="l00447"></a>00447 <span class="comment">        /// Pointer to the value_type. STL required.</span>
<a name="l00448"></a><a class="code" href="a00016.html#adfe951a60a834784653dac6d883f73a8">00448</a> <span class="comment"></span>        <span class="keyword">typedef</span> <a class="code" href="a00016.html#a3ca0d6f7760b4aa78ff47e53e82d7e1f" title="The value type of the btree. Returned by operator*().">value_type</a>*             <a class="code" href="a00016.html#adfe951a60a834784653dac6d883f73a8" title="Pointer to the value_type. STL required.">pointer</a>;
<a name="l00449"></a>00449 <span class="comment"></span>
<a name="l00450"></a>00450 <span class="comment">        /// STL-magic iterator category</span>
<a name="l00451"></a><a class="code" href="a00016.html#ac67229e1e4649f4b77a27dcbd0beb41d">00451</a> <span class="comment"></span>        <span class="keyword">typedef</span> std::bidirectional_iterator_tag <a class="code" href="a00016.html#ac67229e1e4649f4b77a27dcbd0beb41d" title="STL-magic iterator category.">iterator_category</a>;
<a name="l00452"></a>00452 <span class="comment"></span>
<a name="l00453"></a>00453 <span class="comment">        /// STL-magic</span>
<a name="l00454"></a><a class="code" href="a00016.html#a7a8fd55d12a4cb472bcae87285737d77">00454</a> <span class="comment"></span>        <span class="keyword">typedef</span> ptrdiff_t               <a class="code" href="a00016.html#a7a8fd55d12a4cb472bcae87285737d77" title="STL-magic.">difference_type</a>;
<a name="l00455"></a>00455 <span class="comment"></span>
<a name="l00456"></a>00456 <span class="comment">        /// Our own type</span>
<a name="l00457"></a><a class="code" href="a00016.html#a88e3dfff3f3d4601b35cfd4e7f477960">00457</a> <span class="comment"></span>        <span class="keyword">typedef</span> <a class="code" href="a00016.html" title="STL-like iterator object for B+ tree items.">iterator</a>                <span class="keyword">self</span>;
<a name="l00458"></a>00458 
<a name="l00459"></a>00459     <span class="keyword">private</span>:
<a name="l00460"></a>00460         <span class="comment">// *** Members</span>
<a name="l00461"></a>00461 <span class="comment"></span>
<a name="l00462"></a>00462 <span class="comment">        /// The currently referenced leaf node of the tree</span>
<a name="l00463"></a><a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4">00463</a> <span class="comment"></span>        <span class="keyword">typename</span> <a class="code" href="a00017.html" title="Extended structure of a leaf node in memory.">btree::leaf_node</a>*      <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>;
<a name="l00464"></a>00464 <span class="comment"></span>
<a name="l00465"></a>00465 <span class="comment">        /// Current key/data slot referenced</span>
<a name="l00466"></a><a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8">00466</a> <span class="comment"></span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>          <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a>;
<a name="l00467"></a>00467 <span class="comment"></span>
<a name="l00468"></a>00468 <span class="comment">        /// Friendly to the const_iterator, so it may access the two data items</span>
<a name="l00469"></a>00469 <span class="comment">        /// directly.</span>
<a name="l00470"></a><a class="code" href="a00016.html#ac220ce1c155db1ac44146c12d178056f">00470</a> <span class="comment"></span>        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00010.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a>;
<a name="l00471"></a>00471 <span class="comment"></span>
<a name="l00472"></a>00472 <span class="comment">        /// Also friendly to the reverse_iterator, so it may access the two</span>
<a name="l00473"></a>00473 <span class="comment">        /// data items directly.</span>
<a name="l00474"></a><a class="code" href="a00016.html#af0a70641f2216cc31420487a62dd3b0d">00474</a> <span class="comment"></span>        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00020.html" title="STL-like mutable reverse iterator object for B+ tree items.">reverse_iterator</a>;
<a name="l00475"></a>00475 <span class="comment"></span>
<a name="l00476"></a>00476 <span class="comment">        /// Also friendly to the const_reverse_iterator, so it may access the</span>
<a name="l00477"></a>00477 <span class="comment">        /// two data items directly.</span>
<a name="l00478"></a><a class="code" href="a00016.html#a776e261b45ef26d713a4d105a8d7c240">00478</a> <span class="comment"></span>        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00011.html" title="STL-like read-only reverse iterator object for B+ tree items.">const_reverse_iterator</a>;
<a name="l00479"></a>00479 <span class="comment"></span>
<a name="l00480"></a>00480 <span class="comment">        /// Also friendly to the base btree class, because erase_iter() needs</span>
<a name="l00481"></a>00481 <span class="comment">        /// to read the currnode and currslot values directly.</span>
<a name="l00482"></a>00482 <span class="comment"></span>        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree</a>&lt;<a class="code" href="a00016.html#a8b03fc63a85738411711197143596475" title="The key type of the btree. Returned by key().">key_type</a>, <a class="code" href="a00016.html#ac28707a6e23e871cb85c7ff7f8119c73" title="The data type of the btree. Returned by data().">data_type</a>, <a class="code" href="a00016.html#a3ca0d6f7760b4aa78ff47e53e82d7e1f" title="The value type of the btree. Returned by operator*().">value_type</a>, <a class="code" href="a00001.html#a71413b8b8a1440539691a97f4cb61cae" title="Fourth template parameter: Key comparison function object.">key_compare</a>,
<a name="l00483"></a><a class="code" href="a00016.html#a1de115e86b32c4ed13649b6760f1da28">00483</a>                            <a class="code" href="a00001.html#a8b13a0eb2e558d11830d38de21b82319" title="Fifth template parameter: Traits object used to define more parameters of the B+ tree.">traits</a>, <a class="code" href="a00001.html#acd41575a35d1c5d55e955aafc9762454" title="Sixth template parameter: Allow duplicate keys in the B+ tree.">allow_duplicates</a>, <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a>, <a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a>&gt;;
<a name="l00484"></a>00484 <span class="comment"></span>
<a name="l00485"></a>00485 <span class="comment">        /// Evil! A temporary value_type to STL-correctly deliver operator* and</span>
<a name="l00486"></a>00486 <span class="comment">        /// operator-&gt;</span>
<a name="l00487"></a><a class="code" href="a00016.html#a3853bb0ba23d1149d7d3e90d08a74e7f">00487</a> <span class="comment"></span>        <span class="keyword">mutable</span> <a class="code" href="a00016.html#a3ca0d6f7760b4aa78ff47e53e82d7e1f" title="The value type of the btree. Returned by operator*().">value_type</a>              <a class="code" href="a00016.html#a3853bb0ba23d1149d7d3e90d08a74e7f" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a>;
<a name="l00488"></a>00488 
<a name="l00489"></a>00489         <span class="comment">// The macro BTREE_FRIENDS can be used by outside class to access the B+</span>
<a name="l00490"></a>00490         <span class="comment">// tree internals. This was added for wxBTreeDemo to be able to draw the</span>
<a name="l00491"></a>00491         <span class="comment">// tree.</span>
<a name="l00492"></a>00492         <a class="code" href="a00026.html#aec07a93b351ce398f789007a441a4320" title="The macro BTREE_FRIENDS can be used by outside class to access the B+ tree internals.">BTREE_FRIENDS</a>
<a name="l00493"></a>00493 
<a name="l00494"></a>00494     <span class="keyword">public</span>:
<a name="l00495"></a>00495         <span class="comment">// *** Methods</span>
<a name="l00496"></a>00496 <span class="comment"></span>
<a name="l00497"></a>00497 <span class="comment">        /// Default-Constructor of a mutable iterator</span>
<a name="l00498"></a><a class="code" href="a00016.html#a18c4fa1f457e6b7c14cbb610d60e4fdf">00498</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00016.html#a18c4fa1f457e6b7c14cbb610d60e4fdf" title="Default-Constructor of a mutable iterator.">iterator</a>()
<a name="l00499"></a>00499             : <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>(NULL), <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a>(0)
<a name="l00500"></a>00500         { }
<a name="l00501"></a>00501 <span class="comment"></span>
<a name="l00502"></a>00502 <span class="comment">        /// Initializing-Constructor of a mutable iterator</span>
<a name="l00503"></a><a class="code" href="a00016.html#aafad7b45ec60a4466a4695638ed369a4">00503</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00016.html#a18c4fa1f457e6b7c14cbb610d60e4fdf" title="Default-Constructor of a mutable iterator.">iterator</a>(<span class="keyword">typename</span> <a class="code" href="a00017.html" title="Extended structure of a leaf node in memory.">btree::leaf_node</a> *l, <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> s)
<a name="l00504"></a>00504             : <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>(l), <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a>(s)
<a name="l00505"></a>00505         { }
<a name="l00506"></a>00506 <span class="comment"></span>
<a name="l00507"></a>00507 <span class="comment">        /// Copy-constructor from a reverse iterator</span>
<a name="l00508"></a><a class="code" href="a00016.html#addb909f2f9d3b008d43e962b3bc0ef01">00508</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00016.html#a18c4fa1f457e6b7c14cbb610d60e4fdf" title="Default-Constructor of a mutable iterator.">iterator</a>(<span class="keyword">const</span> <a class="code" href="a00020.html" title="STL-like mutable reverse iterator object for B+ tree items.">reverse_iterator</a> &amp;it)
<a name="l00509"></a>00509             : <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>(it.<a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>), <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a>(it.<a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a>)
<a name="l00510"></a>00510         { }
<a name="l00511"></a>00511 <span class="comment"></span>
<a name="l00512"></a>00512 <span class="comment">        /// Dereference the iterator, this is not a value_type&amp; because key and</span>
<a name="l00513"></a>00513 <span class="comment">        /// value are not stored together</span>
<a name="l00514"></a><a class="code" href="a00016.html#ae3399c4dbeb9f3d1cb69f03b0717ef08">00514</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00016.html#ae1af55705fdbcf4a78144fbd6b3df028" title="Reference to the value_type. STL required.">reference</a> <a class="code" href="a00016.html#ae3399c4dbeb9f3d1cb69f03b0717ef08" title="Dereference the iterator, this is not a value_type&amp; because key and value are not stored together...">operator*</a>()<span class="keyword"> const</span>
<a name="l00515"></a>00515 <span class="keyword">        </span>{
<a name="l00516"></a>00516             <a class="code" href="a00016.html#a3853bb0ba23d1149d7d3e90d08a74e7f" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a> = <a class="code" href="a00001.html#a76bd9fc84f712e0d962314c1d6a188ce" title="Using template specialization select the correct converter used by the iterators.">pair_to_value_type</a>()( <a class="code" href="a00016.html#a2b722e1077949a356115387bfd606d63" title="The pair type of the btree.">pair_type</a>(<a class="code" href="a00016.html#a58add29a798f555f30dc83b75bdc8c46" title="Key of the current slot.">key</a>(),<a class="code" href="a00016.html#a374ee1815c28dcef298e20c36cfc8dbc" title="Writable reference to the current data object.">data</a>()) );
<a name="l00517"></a>00517             <span class="keywordflow">return</span> <a class="code" href="a00016.html#a3853bb0ba23d1149d7d3e90d08a74e7f" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a>;
<a name="l00518"></a>00518         }
<a name="l00519"></a>00519 <span class="comment"></span>
<a name="l00520"></a>00520 <span class="comment">        /// Dereference the iterator. Do not use this if possible, use key()</span>
<a name="l00521"></a>00521 <span class="comment">        /// and data() instead. The B+ tree does not stored key and data</span>
<a name="l00522"></a>00522 <span class="comment">        /// together.</span>
<a name="l00523"></a><a class="code" href="a00016.html#a8a59d09fca6bbea43b096ea75048551a">00523</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00016.html#adfe951a60a834784653dac6d883f73a8" title="Pointer to the value_type. STL required.">pointer</a> <a class="code" href="a00016.html#a8a59d09fca6bbea43b096ea75048551a" title="Dereference the iterator.">operator-&gt;</a>()<span class="keyword"> const</span>
<a name="l00524"></a>00524 <span class="keyword">        </span>{
<a name="l00525"></a>00525             <a class="code" href="a00016.html#a3853bb0ba23d1149d7d3e90d08a74e7f" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a> = <a class="code" href="a00001.html#a76bd9fc84f712e0d962314c1d6a188ce" title="Using template specialization select the correct converter used by the iterators.">pair_to_value_type</a>()( <a class="code" href="a00016.html#a2b722e1077949a356115387bfd606d63" title="The pair type of the btree.">pair_type</a>(<a class="code" href="a00016.html#a58add29a798f555f30dc83b75bdc8c46" title="Key of the current slot.">key</a>(),<a class="code" href="a00016.html#a374ee1815c28dcef298e20c36cfc8dbc" title="Writable reference to the current data object.">data</a>()) );
<a name="l00526"></a>00526             <span class="keywordflow">return</span> &amp;<a class="code" href="a00016.html#a3853bb0ba23d1149d7d3e90d08a74e7f" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a>;
<a name="l00527"></a>00527         }
<a name="l00528"></a>00528 <span class="comment"></span>
<a name="l00529"></a>00529 <span class="comment">        /// Key of the current slot</span>
<a name="l00530"></a><a class="code" href="a00016.html#a58add29a798f555f30dc83b75bdc8c46">00530</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="a00016.html#a8b03fc63a85738411711197143596475" title="The key type of the btree. Returned by key().">key_type</a>&amp; <a class="code" href="a00016.html#a58add29a798f555f30dc83b75bdc8c46" title="Key of the current slot.">key</a>()<span class="keyword"> const</span>
<a name="l00531"></a>00531 <span class="keyword">        </span>{
<a name="l00532"></a>00532             <span class="keywordflow">return</span> <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#af92e519f605cf7b7aae74f6f5d6c8bd8" title="Keys of children or data pointers.">slotkey</a>[<a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a>];
<a name="l00533"></a>00533         }
<a name="l00534"></a>00534 <span class="comment"></span>
<a name="l00535"></a>00535 <span class="comment">        /// Writable reference to the current data object</span>
<a name="l00536"></a><a class="code" href="a00016.html#a374ee1815c28dcef298e20c36cfc8dbc">00536</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00016.html#ac28707a6e23e871cb85c7ff7f8119c73" title="The data type of the btree. Returned by data().">data_type</a>&amp; <a class="code" href="a00016.html#a374ee1815c28dcef298e20c36cfc8dbc" title="Writable reference to the current data object.">data</a>()<span class="keyword"> const</span>
<a name="l00537"></a>00537 <span class="keyword">        </span>{
<a name="l00538"></a>00538             <span class="keywordflow">return</span> <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#ad4fc245fe5b90c21dec069792c3f7432" title="Array of data.">slotdata</a>[<a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a> ? 0 : <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a>];
<a name="l00539"></a>00539         }
<a name="l00540"></a>00540 <span class="comment"></span>
<a name="l00541"></a>00541 <span class="comment">        /// Prefix++ advance the iterator to the next slot</span>
<a name="l00542"></a><a class="code" href="a00016.html#affd98a29650798f84818a1de2a0dbc35">00542</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span>&amp; <a class="code" href="a00016.html#affd98a29650798f84818a1de2a0dbc35" title="Prefix++ advance the iterator to the next slot.">operator++</a>()
<a name="l00543"></a>00543         {
<a name="l00544"></a>00544             <span class="keywordflow">if</span> (<a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a> + 1 &lt; <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>) {
<a name="l00545"></a>00545                 ++<a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a>;
<a name="l00546"></a>00546             }
<a name="l00547"></a>00547             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a> != NULL) {
<a name="l00548"></a>00548                 <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a>;
<a name="l00549"></a>00549                 <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a> = 0;
<a name="l00550"></a>00550             }
<a name="l00551"></a>00551             <span class="keywordflow">else</span> {
<a name="l00552"></a>00552                 <span class="comment">// this is end()</span>
<a name="l00553"></a>00553                 <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a> = <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l00554"></a>00554             }
<a name="l00555"></a>00555 
<a name="l00556"></a>00556             <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00557"></a>00557         }
<a name="l00558"></a>00558 <span class="comment"></span>
<a name="l00559"></a>00559 <span class="comment">        /// Postfix++ advance the iterator to the next slot</span>
<a name="l00560"></a><a class="code" href="a00016.html#a1367882a6316d3e4d9075ece22ea77bf">00560</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span> <a class="code" href="a00016.html#affd98a29650798f84818a1de2a0dbc35" title="Prefix++ advance the iterator to the next slot.">operator++</a>(<span class="keywordtype">int</span>)
<a name="l00561"></a>00561         {
<a name="l00562"></a>00562             <span class="keyword">self</span> tmp = *<span class="keyword">this</span>;   <span class="comment">// copy ourselves</span>
<a name="l00563"></a>00563 
<a name="l00564"></a>00564             <span class="keywordflow">if</span> (<a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a> + 1 &lt; <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>) {
<a name="l00565"></a>00565                 ++<a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a>;
<a name="l00566"></a>00566             }
<a name="l00567"></a>00567             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a> != NULL) {
<a name="l00568"></a>00568                 <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a>;
<a name="l00569"></a>00569                 <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a> = 0;
<a name="l00570"></a>00570             }
<a name="l00571"></a>00571             <span class="keywordflow">else</span> {
<a name="l00572"></a>00572                 <span class="comment">// this is end()</span>
<a name="l00573"></a>00573                 <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a> = <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l00574"></a>00574             }
<a name="l00575"></a>00575 
<a name="l00576"></a>00576             <span class="keywordflow">return</span> tmp;
<a name="l00577"></a>00577         }
<a name="l00578"></a>00578 <span class="comment"></span>
<a name="l00579"></a>00579 <span class="comment">        /// Prefix-- backstep the iterator to the last slot</span>
<a name="l00580"></a><a class="code" href="a00016.html#a5807472b2a7f185f65de62b650545f0b">00580</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span>&amp; <a class="code" href="a00016.html#a5807472b2a7f185f65de62b650545f0b" title="Prefix-- backstep the iterator to the last slot.">operator--</a>()
<a name="l00581"></a>00581         {
<a name="l00582"></a>00582             <span class="keywordflow">if</span> (<a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a> &gt; 0) {
<a name="l00583"></a>00583                 --<a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a>;
<a name="l00584"></a>00584             }
<a name="l00585"></a>00585             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> != NULL) {
<a name="l00586"></a>00586                 <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a>;
<a name="l00587"></a>00587                 <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a> = <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> - 1;
<a name="l00588"></a>00588             }
<a name="l00589"></a>00589             <span class="keywordflow">else</span> {
<a name="l00590"></a>00590                 <span class="comment">// this is begin()</span>
<a name="l00591"></a>00591                 <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a> = 0;
<a name="l00592"></a>00592             }
<a name="l00593"></a>00593 
<a name="l00594"></a>00594             <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00595"></a>00595         }
<a name="l00596"></a>00596 <span class="comment"></span>
<a name="l00597"></a>00597 <span class="comment">        /// Postfix-- backstep the iterator to the last slot</span>
<a name="l00598"></a><a class="code" href="a00016.html#a234e0d078e0373687db74565ad23275b">00598</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span> <a class="code" href="a00016.html#a5807472b2a7f185f65de62b650545f0b" title="Prefix-- backstep the iterator to the last slot.">operator--</a>(<span class="keywordtype">int</span>)
<a name="l00599"></a>00599         {
<a name="l00600"></a>00600             <span class="keyword">self</span> tmp = *<span class="keyword">this</span>;   <span class="comment">// copy ourselves</span>
<a name="l00601"></a>00601 
<a name="l00602"></a>00602             <span class="keywordflow">if</span> (<a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a> &gt; 0) {
<a name="l00603"></a>00603                 --<a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a>;
<a name="l00604"></a>00604             }
<a name="l00605"></a>00605             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> != NULL) {
<a name="l00606"></a>00606                 <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a>;
<a name="l00607"></a>00607                 <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a> = <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> - 1;
<a name="l00608"></a>00608             }
<a name="l00609"></a>00609             <span class="keywordflow">else</span> {
<a name="l00610"></a>00610                 <span class="comment">// this is begin()</span>
<a name="l00611"></a>00611                 <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a> = 0;
<a name="l00612"></a>00612             }
<a name="l00613"></a>00613 
<a name="l00614"></a>00614             <span class="keywordflow">return</span> tmp;
<a name="l00615"></a>00615         }
<a name="l00616"></a>00616 <span class="comment"></span>
<a name="l00617"></a>00617 <span class="comment">        /// Equality of iterators</span>
<a name="l00618"></a><a class="code" href="a00016.html#a219e56b7da3e108394d14707f1b05da3">00618</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00016.html#a219e56b7da3e108394d14707f1b05da3" title="Equality of iterators.">operator==</a>(<span class="keyword">const</span> <span class="keyword">self</span>&amp; x)<span class="keyword"> const</span>
<a name="l00619"></a>00619 <span class="keyword">        </span>{
<a name="l00620"></a>00620             <span class="keywordflow">return</span> (x.currnode == <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>) &amp;&amp; (x.currslot == <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a>);
<a name="l00621"></a>00621         }
<a name="l00622"></a>00622 <span class="comment"></span>
<a name="l00623"></a>00623 <span class="comment">        /// Inequality of iterators</span>
<a name="l00624"></a><a class="code" href="a00016.html#ae8b63ca7ab4ca95783fcff9d7381f65d">00624</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00016.html#ae8b63ca7ab4ca95783fcff9d7381f65d" title="Inequality of iterators.">operator!=</a>(<span class="keyword">const</span> <span class="keyword">self</span>&amp; x)<span class="keyword"> const</span>
<a name="l00625"></a>00625 <span class="keyword">        </span>{
<a name="l00626"></a>00626             <span class="keywordflow">return</span> (x.currnode != <a class="code" href="a00016.html#a2342904be584a159fa07a1fe280428b4" title="The currently referenced leaf node of the tree.">currnode</a>) || (x.currslot != <a class="code" href="a00016.html#a7a8172193bcc54048fbc4d38a9b0dde8" title="Current key/data slot referenced.">currslot</a>);
<a name="l00627"></a>00627         }
<a name="l00628"></a>00628     };
<a name="l00629"></a>00629 <span class="comment"></span>
<a name="l00630"></a>00630 <span class="comment">    /// STL-like read-only iterator object for B+ tree items. The iterator</span>
<a name="l00631"></a>00631 <span class="comment">    /// points to a specific slot number in a leaf.</span>
<a name="l00632"></a><a class="code" href="a00010.html">00632</a> <span class="comment"></span>    <span class="keyword">class </span><a class="code" href="a00010.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a>
<a name="l00633"></a>00633     {
<a name="l00634"></a>00634     <span class="keyword">public</span>:
<a name="l00635"></a>00635         <span class="comment">// *** Types</span>
<a name="l00636"></a>00636 <span class="comment"></span>
<a name="l00637"></a>00637 <span class="comment">        /// The key type of the btree. Returned by key().</span>
<a name="l00638"></a><a class="code" href="a00010.html#af9bd869933413977b355edecdad03826">00638</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">btree::key_type</a>                <a class="code" href="a00010.html#af9bd869933413977b355edecdad03826" title="The key type of the btree. Returned by key().">key_type</a>;
<a name="l00639"></a>00639 <span class="comment"></span>
<a name="l00640"></a>00640 <span class="comment">        /// The data type of the btree. Returned by data().</span>
<a name="l00641"></a><a class="code" href="a00010.html#a3e9bc58f428c88258f0f6dae0d1b262f">00641</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">btree::data_type</a>               <a class="code" href="a00010.html#a3e9bc58f428c88258f0f6dae0d1b262f" title="The data type of the btree. Returned by data().">data_type</a>;
<a name="l00642"></a>00642 <span class="comment"></span>
<a name="l00643"></a>00643 <span class="comment">        /// The value type of the btree. Returned by operator*().</span>
<a name="l00644"></a><a class="code" href="a00010.html#a35215b1458e16ce11dd75678d50e10f2">00644</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">btree::value_type</a>              <a class="code" href="a00010.html#a35215b1458e16ce11dd75678d50e10f2" title="The value type of the btree. Returned by operator*().">value_type</a>;
<a name="l00645"></a>00645 <span class="comment"></span>
<a name="l00646"></a>00646 <span class="comment">        /// The pair type of the btree.</span>
<a name="l00647"></a><a class="code" href="a00010.html#ad5418a87bffde41e783a232e6304d690">00647</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#a2cddd431e50047766f45902b9f6f5c31" title="The pair of key_type and data_type, this may be different from value_type.">btree::pair_type</a>               <a class="code" href="a00010.html#ad5418a87bffde41e783a232e6304d690" title="The pair type of the btree.">pair_type</a>;
<a name="l00648"></a>00648 <span class="comment"></span>
<a name="l00649"></a>00649 <span class="comment">        /// Reference to the value_type. STL required.</span>
<a name="l00650"></a><a class="code" href="a00010.html#a419752bbbda4094865f8d8e13d16b2ba">00650</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">const</span> <a class="code" href="a00010.html#a35215b1458e16ce11dd75678d50e10f2" title="The value type of the btree. Returned by operator*().">value_type</a>&amp;               <a class="code" href="a00010.html#a419752bbbda4094865f8d8e13d16b2ba" title="Reference to the value_type. STL required.">reference</a>;
<a name="l00651"></a>00651 <span class="comment"></span>
<a name="l00652"></a>00652 <span class="comment">        /// Pointer to the value_type. STL required.</span>
<a name="l00653"></a><a class="code" href="a00010.html#ae6ef73c30bc2db3e007309f4f5791ce1">00653</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">const</span> <a class="code" href="a00010.html#a35215b1458e16ce11dd75678d50e10f2" title="The value type of the btree. Returned by operator*().">value_type</a>*               <a class="code" href="a00010.html#ae6ef73c30bc2db3e007309f4f5791ce1" title="Pointer to the value_type. STL required.">pointer</a>;
<a name="l00654"></a>00654 <span class="comment"></span>
<a name="l00655"></a>00655 <span class="comment">        /// STL-magic iterator category</span>
<a name="l00656"></a><a class="code" href="a00010.html#a2fd7333035de59a5c83df70a96a53b7c">00656</a> <span class="comment"></span>        <span class="keyword">typedef</span> std::bidirectional_iterator_tag         <a class="code" href="a00010.html#a2fd7333035de59a5c83df70a96a53b7c" title="STL-magic iterator category.">iterator_category</a>;
<a name="l00657"></a>00657 <span class="comment"></span>
<a name="l00658"></a>00658 <span class="comment">        /// STL-magic</span>
<a name="l00659"></a><a class="code" href="a00010.html#a3259e576dca916415ada01c0b579c6fb">00659</a> <span class="comment"></span>        <span class="keyword">typedef</span> ptrdiff_t               <a class="code" href="a00010.html#a3259e576dca916415ada01c0b579c6fb" title="STL-magic.">difference_type</a>;
<a name="l00660"></a>00660 <span class="comment"></span>
<a name="l00661"></a>00661 <span class="comment">        /// Our own type</span>
<a name="l00662"></a><a class="code" href="a00010.html#af6590c93be7bee1df834d22122d703a1">00662</a> <span class="comment"></span>        <span class="keyword">typedef</span> <a class="code" href="a00010.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a>          <span class="keyword">self</span>;
<a name="l00663"></a>00663 
<a name="l00664"></a>00664     <span class="keyword">private</span>:
<a name="l00665"></a>00665         <span class="comment">// *** Members</span>
<a name="l00666"></a>00666 <span class="comment"></span>
<a name="l00667"></a>00667 <span class="comment">        /// The currently referenced leaf node of the tree</span>
<a name="l00668"></a><a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46">00668</a> <span class="comment"></span>        <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="a00017.html" title="Extended structure of a leaf node in memory.">btree::leaf_node</a>*        <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>;
<a name="l00669"></a>00669 <span class="comment"></span>
<a name="l00670"></a>00670 <span class="comment">        /// Current key/data slot referenced</span>
<a name="l00671"></a><a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde">00671</a> <span class="comment"></span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>                  <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>;
<a name="l00672"></a>00672 <span class="comment"></span>
<a name="l00673"></a>00673 <span class="comment">        /// Friendly to the reverse_const_iterator, so it may access the two</span>
<a name="l00674"></a>00674 <span class="comment">        /// data items directly</span>
<a name="l00675"></a><a class="code" href="a00010.html#a776e261b45ef26d713a4d105a8d7c240">00675</a> <span class="comment"></span>        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00011.html" title="STL-like read-only reverse iterator object for B+ tree items.">const_reverse_iterator</a>;
<a name="l00676"></a>00676 <span class="comment"></span>
<a name="l00677"></a>00677 <span class="comment">        /// Evil! A temporary value_type to STL-correctly deliver operator* and</span>
<a name="l00678"></a>00678 <span class="comment">        /// operator-&gt;</span>
<a name="l00679"></a><a class="code" href="a00010.html#a390bd1c0e4146b53df1c725a9c52dfa5">00679</a> <span class="comment"></span>        <span class="keyword">mutable</span> <a class="code" href="a00010.html#a35215b1458e16ce11dd75678d50e10f2" title="The value type of the btree. Returned by operator*().">value_type</a>              <a class="code" href="a00010.html#a390bd1c0e4146b53df1c725a9c52dfa5" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a>;
<a name="l00680"></a>00680 
<a name="l00681"></a>00681         <span class="comment">// The macro BTREE_FRIENDS can be used by outside class to access the B+</span>
<a name="l00682"></a>00682         <span class="comment">// tree internals. This was added for wxBTreeDemo to be able to draw the</span>
<a name="l00683"></a>00683         <span class="comment">// tree.</span>
<a name="l00684"></a>00684         <a class="code" href="a00026.html#aec07a93b351ce398f789007a441a4320" title="The macro BTREE_FRIENDS can be used by outside class to access the B+ tree internals.">BTREE_FRIENDS</a>
<a name="l00685"></a>00685 
<a name="l00686"></a>00686     <span class="keyword">public</span>:
<a name="l00687"></a>00687         <span class="comment">// *** Methods</span>
<a name="l00688"></a>00688 <span class="comment"></span>
<a name="l00689"></a>00689 <span class="comment">        /// Default-Constructor of a const iterator</span>
<a name="l00690"></a><a class="code" href="a00010.html#aa398e6e926d38251e31e4448328ee504">00690</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00010.html#aa398e6e926d38251e31e4448328ee504" title="Default-Constructor of a const iterator.">const_iterator</a>()
<a name="l00691"></a>00691             : <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>(NULL), <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>(0)
<a name="l00692"></a>00692         { }
<a name="l00693"></a>00693 <span class="comment"></span>
<a name="l00694"></a>00694 <span class="comment">        /// Initializing-Constructor of a const iterator</span>
<a name="l00695"></a><a class="code" href="a00010.html#a56aba66f521f1a397d380921437fb689">00695</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00010.html#aa398e6e926d38251e31e4448328ee504" title="Default-Constructor of a const iterator.">const_iterator</a>(<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="a00017.html" title="Extended structure of a leaf node in memory.">btree::leaf_node</a> *l, <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> s)
<a name="l00696"></a>00696             : <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>(l), <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>(s)
<a name="l00697"></a>00697         { }
<a name="l00698"></a>00698 <span class="comment"></span>
<a name="l00699"></a>00699 <span class="comment">        /// Copy-constructor from a mutable iterator</span>
<a name="l00700"></a><a class="code" href="a00010.html#a8eeaa8f21a999eb9ceba7445a5f2249c">00700</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00010.html#aa398e6e926d38251e31e4448328ee504" title="Default-Constructor of a const iterator.">const_iterator</a>(<span class="keyword">const</span> <a class="code" href="a00016.html" title="STL-like iterator object for B+ tree items.">iterator</a> &amp;it)
<a name="l00701"></a>00701             : <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>(it.<a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>), <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>(it.<a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>)
<a name="l00702"></a>00702         { }
<a name="l00703"></a>00703 <span class="comment"></span>
<a name="l00704"></a>00704 <span class="comment">        /// Copy-constructor from a mutable reverse iterator</span>
<a name="l00705"></a><a class="code" href="a00010.html#a804b6134629b6005947bb53896593dc2">00705</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00010.html#aa398e6e926d38251e31e4448328ee504" title="Default-Constructor of a const iterator.">const_iterator</a>(<span class="keyword">const</span> <a class="code" href="a00020.html" title="STL-like mutable reverse iterator object for B+ tree items.">reverse_iterator</a> &amp;it)
<a name="l00706"></a>00706             : <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>(it.<a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>), <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>(it.<a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>)
<a name="l00707"></a>00707         { }
<a name="l00708"></a>00708 <span class="comment"></span>
<a name="l00709"></a>00709 <span class="comment">        /// Copy-constructor from a const reverse iterator</span>
<a name="l00710"></a><a class="code" href="a00010.html#adf2a0a9f38ed9d19fc35a29e7ca9f501">00710</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00010.html#aa398e6e926d38251e31e4448328ee504" title="Default-Constructor of a const iterator.">const_iterator</a>(<span class="keyword">const</span> <a class="code" href="a00011.html" title="STL-like read-only reverse iterator object for B+ tree items.">const_reverse_iterator</a> &amp;it)
<a name="l00711"></a>00711             : <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>(it.<a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>), <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>(it.<a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>)
<a name="l00712"></a>00712         { }
<a name="l00713"></a>00713 <span class="comment"></span>
<a name="l00714"></a>00714 <span class="comment">        /// Dereference the iterator. Do not use this if possible, use key()</span>
<a name="l00715"></a>00715 <span class="comment">        /// and data() instead. The B+ tree does not stored key and data</span>
<a name="l00716"></a>00716 <span class="comment">        /// together.</span>
<a name="l00717"></a><a class="code" href="a00010.html#a07b48aa4ca141c1f1d53c150f33e591b">00717</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00010.html#a419752bbbda4094865f8d8e13d16b2ba" title="Reference to the value_type. STL required.">reference</a> <a class="code" href="a00010.html#a07b48aa4ca141c1f1d53c150f33e591b" title="Dereference the iterator.">operator*</a>()<span class="keyword"> const</span>
<a name="l00718"></a>00718 <span class="keyword">        </span>{
<a name="l00719"></a>00719             <a class="code" href="a00010.html#a390bd1c0e4146b53df1c725a9c52dfa5" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a> = <a class="code" href="a00001.html#a76bd9fc84f712e0d962314c1d6a188ce" title="Using template specialization select the correct converter used by the iterators.">pair_to_value_type</a>()( <a class="code" href="a00010.html#ad5418a87bffde41e783a232e6304d690" title="The pair type of the btree.">pair_type</a>(<a class="code" href="a00010.html#a9b700cfcf53b89ce178833f9bed1df2f" title="Key of the current slot.">key</a>(),<a class="code" href="a00010.html#a0c38df0d4e1f83c33c52c63b2ca6edd9" title="Read-only reference to the current data object.">data</a>()) );
<a name="l00720"></a>00720             <span class="keywordflow">return</span> <a class="code" href="a00010.html#a390bd1c0e4146b53df1c725a9c52dfa5" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a>;
<a name="l00721"></a>00721         }
<a name="l00722"></a>00722 <span class="comment"></span>
<a name="l00723"></a>00723 <span class="comment">        /// Dereference the iterator. Do not use this if possible, use key()</span>
<a name="l00724"></a>00724 <span class="comment">        /// and data() instead. The B+ tree does not stored key and data</span>
<a name="l00725"></a>00725 <span class="comment">        /// together.</span>
<a name="l00726"></a><a class="code" href="a00010.html#a670a87d8fccf4c9aab90f5a6b2a22d75">00726</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00010.html#ae6ef73c30bc2db3e007309f4f5791ce1" title="Pointer to the value_type. STL required.">pointer</a> <a class="code" href="a00010.html#a670a87d8fccf4c9aab90f5a6b2a22d75" title="Dereference the iterator.">operator-&gt;</a>()<span class="keyword"> const</span>
<a name="l00727"></a>00727 <span class="keyword">        </span>{
<a name="l00728"></a>00728             <a class="code" href="a00010.html#a390bd1c0e4146b53df1c725a9c52dfa5" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a> = <a class="code" href="a00001.html#a76bd9fc84f712e0d962314c1d6a188ce" title="Using template specialization select the correct converter used by the iterators.">pair_to_value_type</a>()( <a class="code" href="a00010.html#ad5418a87bffde41e783a232e6304d690" title="The pair type of the btree.">pair_type</a>(<a class="code" href="a00010.html#a9b700cfcf53b89ce178833f9bed1df2f" title="Key of the current slot.">key</a>(),<a class="code" href="a00010.html#a0c38df0d4e1f83c33c52c63b2ca6edd9" title="Read-only reference to the current data object.">data</a>()) );
<a name="l00729"></a>00729             <span class="keywordflow">return</span> &amp;<a class="code" href="a00010.html#a390bd1c0e4146b53df1c725a9c52dfa5" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a>;
<a name="l00730"></a>00730         }
<a name="l00731"></a>00731 <span class="comment"></span>
<a name="l00732"></a>00732 <span class="comment">        /// Key of the current slot</span>
<a name="l00733"></a><a class="code" href="a00010.html#a9b700cfcf53b89ce178833f9bed1df2f">00733</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="a00010.html#af9bd869933413977b355edecdad03826" title="The key type of the btree. Returned by key().">key_type</a>&amp; <a class="code" href="a00010.html#a9b700cfcf53b89ce178833f9bed1df2f" title="Key of the current slot.">key</a>()<span class="keyword"> const</span>
<a name="l00734"></a>00734 <span class="keyword">        </span>{
<a name="l00735"></a>00735             <span class="keywordflow">return</span> <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#af92e519f605cf7b7aae74f6f5d6c8bd8" title="Keys of children or data pointers.">slotkey</a>[<a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>];
<a name="l00736"></a>00736         }
<a name="l00737"></a>00737 <span class="comment"></span>
<a name="l00738"></a>00738 <span class="comment">        /// Read-only reference to the current data object</span>
<a name="l00739"></a><a class="code" href="a00010.html#a0c38df0d4e1f83c33c52c63b2ca6edd9">00739</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="a00010.html#a3e9bc58f428c88258f0f6dae0d1b262f" title="The data type of the btree. Returned by data().">data_type</a>&amp; <a class="code" href="a00010.html#a0c38df0d4e1f83c33c52c63b2ca6edd9" title="Read-only reference to the current data object.">data</a>()<span class="keyword"> const</span>
<a name="l00740"></a>00740 <span class="keyword">        </span>{
<a name="l00741"></a>00741             <span class="keywordflow">return</span> <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#ad4fc245fe5b90c21dec069792c3f7432" title="Array of data.">slotdata</a>[<a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a> ? 0 : <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>];
<a name="l00742"></a>00742         }
<a name="l00743"></a>00743 <span class="comment"></span>
<a name="l00744"></a>00744 <span class="comment">        /// Prefix++ advance the iterator to the next slot</span>
<a name="l00745"></a><a class="code" href="a00010.html#a70dced9b01dbb9ea963e072c837eff09">00745</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span>&amp; <a class="code" href="a00010.html#a70dced9b01dbb9ea963e072c837eff09" title="Prefix++ advance the iterator to the next slot.">operator++</a>()
<a name="l00746"></a>00746         {
<a name="l00747"></a>00747             <span class="keywordflow">if</span> (<a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a> + 1 &lt; <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>) {
<a name="l00748"></a>00748                 ++<a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>;
<a name="l00749"></a>00749             }
<a name="l00750"></a>00750             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a> != NULL) {
<a name="l00751"></a>00751                 <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a>;
<a name="l00752"></a>00752                 <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a> = 0;
<a name="l00753"></a>00753             }
<a name="l00754"></a>00754             <span class="keywordflow">else</span> {
<a name="l00755"></a>00755                 <span class="comment">// this is end()</span>
<a name="l00756"></a>00756                 <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a> = <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l00757"></a>00757             }
<a name="l00758"></a>00758 
<a name="l00759"></a>00759             <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00760"></a>00760         }
<a name="l00761"></a>00761 <span class="comment"></span>
<a name="l00762"></a>00762 <span class="comment">        /// Postfix++ advance the iterator to the next slot</span>
<a name="l00763"></a><a class="code" href="a00010.html#a18c993a3ff60f293e9a3f37adda41ddb">00763</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span> <a class="code" href="a00010.html#a70dced9b01dbb9ea963e072c837eff09" title="Prefix++ advance the iterator to the next slot.">operator++</a>(<span class="keywordtype">int</span>)
<a name="l00764"></a>00764         {
<a name="l00765"></a>00765             <span class="keyword">self</span> tmp = *<span class="keyword">this</span>;   <span class="comment">// copy ourselves</span>
<a name="l00766"></a>00766 
<a name="l00767"></a>00767             <span class="keywordflow">if</span> (<a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a> + 1 &lt; <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>) {
<a name="l00768"></a>00768                 ++<a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>;
<a name="l00769"></a>00769             }
<a name="l00770"></a>00770             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a> != NULL) {
<a name="l00771"></a>00771                 <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a>;
<a name="l00772"></a>00772                 <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a> = 0;
<a name="l00773"></a>00773             }
<a name="l00774"></a>00774             <span class="keywordflow">else</span> {
<a name="l00775"></a>00775                 <span class="comment">// this is end()</span>
<a name="l00776"></a>00776                 <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a> = <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l00777"></a>00777             }
<a name="l00778"></a>00778 
<a name="l00779"></a>00779             <span class="keywordflow">return</span> tmp;
<a name="l00780"></a>00780         }
<a name="l00781"></a>00781 <span class="comment"></span>
<a name="l00782"></a>00782 <span class="comment">        /// Prefix-- backstep the iterator to the last slot</span>
<a name="l00783"></a><a class="code" href="a00010.html#a5ec18e7ef4ca59cd65992fc37e86582b">00783</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span>&amp; <a class="code" href="a00010.html#a5ec18e7ef4ca59cd65992fc37e86582b" title="Prefix-- backstep the iterator to the last slot.">operator--</a>()
<a name="l00784"></a>00784         {
<a name="l00785"></a>00785             <span class="keywordflow">if</span> (<a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a> &gt; 0) {
<a name="l00786"></a>00786                 --<a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>;
<a name="l00787"></a>00787             }
<a name="l00788"></a>00788             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> != NULL) {
<a name="l00789"></a>00789                 <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a>;
<a name="l00790"></a>00790                 <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a> = <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> - 1;
<a name="l00791"></a>00791             }
<a name="l00792"></a>00792             <span class="keywordflow">else</span> {
<a name="l00793"></a>00793                 <span class="comment">// this is begin()</span>
<a name="l00794"></a>00794                 <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a> = 0;
<a name="l00795"></a>00795             }
<a name="l00796"></a>00796 
<a name="l00797"></a>00797             <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00798"></a>00798         }
<a name="l00799"></a>00799 <span class="comment"></span>
<a name="l00800"></a>00800 <span class="comment">        /// Postfix-- backstep the iterator to the last slot</span>
<a name="l00801"></a><a class="code" href="a00010.html#a625efcb27c39904ffa30e9476262d234">00801</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span> <a class="code" href="a00010.html#a5ec18e7ef4ca59cd65992fc37e86582b" title="Prefix-- backstep the iterator to the last slot.">operator--</a>(<span class="keywordtype">int</span>)
<a name="l00802"></a>00802         {
<a name="l00803"></a>00803             <span class="keyword">self</span> tmp = *<span class="keyword">this</span>;   <span class="comment">// copy ourselves</span>
<a name="l00804"></a>00804 
<a name="l00805"></a>00805             <span class="keywordflow">if</span> (<a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a> &gt; 0) {
<a name="l00806"></a>00806                 --<a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>;
<a name="l00807"></a>00807             }
<a name="l00808"></a>00808             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> != NULL) {
<a name="l00809"></a>00809                 <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a>;
<a name="l00810"></a>00810                 <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a> = <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> - 1;
<a name="l00811"></a>00811             }
<a name="l00812"></a>00812             <span class="keywordflow">else</span> {
<a name="l00813"></a>00813                 <span class="comment">// this is begin()</span>
<a name="l00814"></a>00814                 <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a> = 0;
<a name="l00815"></a>00815             }
<a name="l00816"></a>00816 
<a name="l00817"></a>00817             <span class="keywordflow">return</span> tmp;
<a name="l00818"></a>00818         }
<a name="l00819"></a>00819 <span class="comment"></span>
<a name="l00820"></a>00820 <span class="comment">        /// Equality of iterators</span>
<a name="l00821"></a><a class="code" href="a00010.html#acb7975fe9086511b129da9bc6c579b7f">00821</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00010.html#acb7975fe9086511b129da9bc6c579b7f" title="Equality of iterators.">operator==</a>(<span class="keyword">const</span> <span class="keyword">self</span>&amp; x)<span class="keyword"> const</span>
<a name="l00822"></a>00822 <span class="keyword">        </span>{
<a name="l00823"></a>00823             <span class="keywordflow">return</span> (x.currnode == <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>) &amp;&amp; (x.currslot == <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>);
<a name="l00824"></a>00824         }
<a name="l00825"></a>00825 <span class="comment"></span>
<a name="l00826"></a>00826 <span class="comment">        /// Inequality of iterators</span>
<a name="l00827"></a><a class="code" href="a00010.html#afe4bead48fa24df2c42b6cff6be9c8fb">00827</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00010.html#afe4bead48fa24df2c42b6cff6be9c8fb" title="Inequality of iterators.">operator!=</a>(<span class="keyword">const</span> <span class="keyword">self</span>&amp; x)<span class="keyword"> const</span>
<a name="l00828"></a>00828 <span class="keyword">        </span>{
<a name="l00829"></a>00829             <span class="keywordflow">return</span> (x.currnode != <a class="code" href="a00010.html#aaf41fc7558a241186e7aeb4fd4c26d46" title="The currently referenced leaf node of the tree.">currnode</a>) || (x.currslot != <a class="code" href="a00010.html#a384e9365c13f059943588447ab9aefde" title="Current key/data slot referenced.">currslot</a>);
<a name="l00830"></a>00830         }
<a name="l00831"></a>00831     };
<a name="l00832"></a>00832 <span class="comment"></span>
<a name="l00833"></a>00833 <span class="comment">    /// STL-like mutable reverse iterator object for B+ tree items. The</span>
<a name="l00834"></a>00834 <span class="comment">    /// iterator points to a specific slot number in a leaf.</span>
<a name="l00835"></a><a class="code" href="a00020.html">00835</a> <span class="comment"></span>    <span class="keyword">class </span><a class="code" href="a00020.html" title="STL-like mutable reverse iterator object for B+ tree items.">reverse_iterator</a>
<a name="l00836"></a>00836     {
<a name="l00837"></a>00837     <span class="keyword">public</span>:
<a name="l00838"></a>00838         <span class="comment">// *** Types</span>
<a name="l00839"></a>00839 <span class="comment"></span>
<a name="l00840"></a>00840 <span class="comment">        /// The key type of the btree. Returned by key().</span>
<a name="l00841"></a><a class="code" href="a00020.html#a6c51c511a728641235b1b766d370d947">00841</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">btree::key_type</a>                <a class="code" href="a00020.html#a6c51c511a728641235b1b766d370d947" title="The key type of the btree. Returned by key().">key_type</a>;
<a name="l00842"></a>00842 <span class="comment"></span>
<a name="l00843"></a>00843 <span class="comment">        /// The data type of the btree. Returned by data().</span>
<a name="l00844"></a><a class="code" href="a00020.html#adbbb473dc39aa6939320a775270db73b">00844</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">btree::data_type</a>               <a class="code" href="a00020.html#adbbb473dc39aa6939320a775270db73b" title="The data type of the btree. Returned by data().">data_type</a>;
<a name="l00845"></a>00845 <span class="comment"></span>
<a name="l00846"></a>00846 <span class="comment">        /// The value type of the btree. Returned by operator*().</span>
<a name="l00847"></a><a class="code" href="a00020.html#a4d5aa6d6f89994af073ed8de8023b702">00847</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">btree::value_type</a>              <a class="code" href="a00020.html#a4d5aa6d6f89994af073ed8de8023b702" title="The value type of the btree. Returned by operator*().">value_type</a>;
<a name="l00848"></a>00848 <span class="comment"></span>
<a name="l00849"></a>00849 <span class="comment">        /// The pair type of the btree.</span>
<a name="l00850"></a><a class="code" href="a00020.html#a29586b9555247c18a0bbc963077277cc">00850</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#a2cddd431e50047766f45902b9f6f5c31" title="The pair of key_type and data_type, this may be different from value_type.">btree::pair_type</a>               <a class="code" href="a00020.html#a29586b9555247c18a0bbc963077277cc" title="The pair type of the btree.">pair_type</a>;
<a name="l00851"></a>00851 <span class="comment"></span>
<a name="l00852"></a>00852 <span class="comment">        /// Reference to the value_type. STL required.</span>
<a name="l00853"></a><a class="code" href="a00020.html#aafabdbb26269c865eff146d29d106d95">00853</a> <span class="comment"></span>        <span class="keyword">typedef</span> <a class="code" href="a00020.html#a4d5aa6d6f89994af073ed8de8023b702" title="The value type of the btree. Returned by operator*().">value_type</a>&amp;             <a class="code" href="a00020.html#aafabdbb26269c865eff146d29d106d95" title="Reference to the value_type. STL required.">reference</a>;
<a name="l00854"></a>00854 <span class="comment"></span>
<a name="l00855"></a>00855 <span class="comment">        /// Pointer to the value_type. STL required.</span>
<a name="l00856"></a><a class="code" href="a00020.html#abec59d5ad25b0caaa3dbd19cb1e5c1b4">00856</a> <span class="comment"></span>        <span class="keyword">typedef</span> <a class="code" href="a00020.html#a4d5aa6d6f89994af073ed8de8023b702" title="The value type of the btree. Returned by operator*().">value_type</a>*             <a class="code" href="a00020.html#abec59d5ad25b0caaa3dbd19cb1e5c1b4" title="Pointer to the value_type. STL required.">pointer</a>;
<a name="l00857"></a>00857 <span class="comment"></span>
<a name="l00858"></a>00858 <span class="comment">        /// STL-magic iterator category</span>
<a name="l00859"></a><a class="code" href="a00020.html#aedcdafaa9eadd4eadb05e09b44aa17f9">00859</a> <span class="comment"></span>        <span class="keyword">typedef</span> std::bidirectional_iterator_tag <a class="code" href="a00020.html#aedcdafaa9eadd4eadb05e09b44aa17f9" title="STL-magic iterator category.">iterator_category</a>;
<a name="l00860"></a>00860 <span class="comment"></span>
<a name="l00861"></a>00861 <span class="comment">        /// STL-magic</span>
<a name="l00862"></a><a class="code" href="a00020.html#a1821d9cc06d632bfb5d2fcc277413c79">00862</a> <span class="comment"></span>        <span class="keyword">typedef</span> ptrdiff_t               <a class="code" href="a00020.html#a1821d9cc06d632bfb5d2fcc277413c79" title="STL-magic.">difference_type</a>;
<a name="l00863"></a>00863 <span class="comment"></span>
<a name="l00864"></a>00864 <span class="comment">        /// Our own type</span>
<a name="l00865"></a><a class="code" href="a00020.html#a7730c375657891e38202c564487c5249">00865</a> <span class="comment"></span>        <span class="keyword">typedef</span> <a class="code" href="a00020.html" title="STL-like mutable reverse iterator object for B+ tree items.">reverse_iterator</a>        <span class="keyword">self</span>;
<a name="l00866"></a>00866 
<a name="l00867"></a>00867     <span class="keyword">private</span>:
<a name="l00868"></a>00868         <span class="comment">// *** Members</span>
<a name="l00869"></a>00869 <span class="comment"></span>
<a name="l00870"></a>00870 <span class="comment">        /// The currently referenced leaf node of the tree</span>
<a name="l00871"></a><a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd">00871</a> <span class="comment"></span>        <span class="keyword">typename</span> <a class="code" href="a00017.html" title="Extended structure of a leaf node in memory.">btree::leaf_node</a>*      <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>;
<a name="l00872"></a>00872 <span class="comment"></span>
<a name="l00873"></a>00873 <span class="comment">        /// One slot past the current key/data slot referenced.</span>
<a name="l00874"></a><a class="code" href="a00020.html#a18093d258964badd66e623908a699774">00874</a> <span class="comment"></span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>          <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a>;
<a name="l00875"></a>00875 <span class="comment"></span>
<a name="l00876"></a>00876 <span class="comment">        /// Friendly to the const_iterator, so it may access the two data items</span>
<a name="l00877"></a>00877 <span class="comment">        /// directly</span>
<a name="l00878"></a><a class="code" href="a00020.html#a67171474c4da6cc8efe0c7fafefd2b2d">00878</a> <span class="comment"></span>        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00016.html" title="STL-like iterator object for B+ tree items.">iterator</a>;
<a name="l00879"></a>00879 <span class="comment"></span>
<a name="l00880"></a>00880 <span class="comment">        /// Also friendly to the const_iterator, so it may access the two data</span>
<a name="l00881"></a>00881 <span class="comment">        /// items directly</span>
<a name="l00882"></a><a class="code" href="a00020.html#ac220ce1c155db1ac44146c12d178056f">00882</a> <span class="comment"></span>        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00010.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a>;
<a name="l00883"></a>00883 <span class="comment"></span>
<a name="l00884"></a>00884 <span class="comment">        /// Also friendly to the const_iterator, so it may access the two data</span>
<a name="l00885"></a>00885 <span class="comment">        /// items directly</span>
<a name="l00886"></a><a class="code" href="a00020.html#a776e261b45ef26d713a4d105a8d7c240">00886</a> <span class="comment"></span>        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00011.html" title="STL-like read-only reverse iterator object for B+ tree items.">const_reverse_iterator</a>;
<a name="l00887"></a>00887 <span class="comment"></span>
<a name="l00888"></a>00888 <span class="comment">        /// Evil! A temporary value_type to STL-correctly deliver operator* and</span>
<a name="l00889"></a>00889 <span class="comment">        /// operator-&gt;</span>
<a name="l00890"></a><a class="code" href="a00020.html#a63ccdf692264f526659802b5326bc13c">00890</a> <span class="comment"></span>        <span class="keyword">mutable</span> <a class="code" href="a00020.html#a4d5aa6d6f89994af073ed8de8023b702" title="The value type of the btree. Returned by operator*().">value_type</a>              <a class="code" href="a00020.html#a63ccdf692264f526659802b5326bc13c" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a>;
<a name="l00891"></a>00891 
<a name="l00892"></a>00892         <span class="comment">// The macro BTREE_FRIENDS can be used by outside class to access the B+</span>
<a name="l00893"></a>00893         <span class="comment">// tree internals. This was added for wxBTreeDemo to be able to draw the</span>
<a name="l00894"></a>00894         <span class="comment">// tree.</span>
<a name="l00895"></a>00895         <a class="code" href="a00026.html#aec07a93b351ce398f789007a441a4320" title="The macro BTREE_FRIENDS can be used by outside class to access the B+ tree internals.">BTREE_FRIENDS</a>
<a name="l00896"></a>00896 
<a name="l00897"></a>00897     <span class="keyword">public</span>:
<a name="l00898"></a>00898         <span class="comment">// *** Methods</span>
<a name="l00899"></a>00899 <span class="comment"></span>
<a name="l00900"></a>00900 <span class="comment">        /// Default-Constructor of a reverse iterator</span>
<a name="l00901"></a><a class="code" href="a00020.html#a037a981f590f5cf648a66f84a37a8e01">00901</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00020.html#a037a981f590f5cf648a66f84a37a8e01" title="Default-Constructor of a reverse iterator.">reverse_iterator</a>()
<a name="l00902"></a>00902             : <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>(NULL), <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a>(0)
<a name="l00903"></a>00903         { }
<a name="l00904"></a>00904 <span class="comment"></span>
<a name="l00905"></a>00905 <span class="comment">        /// Initializing-Constructor of a mutable reverse iterator</span>
<a name="l00906"></a><a class="code" href="a00020.html#af9450ea2c4aa1326fb62099d9a15f10c">00906</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00020.html#a037a981f590f5cf648a66f84a37a8e01" title="Default-Constructor of a reverse iterator.">reverse_iterator</a>(<span class="keyword">typename</span> <a class="code" href="a00017.html" title="Extended structure of a leaf node in memory.">btree::leaf_node</a> *l, <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> s)
<a name="l00907"></a>00907             : <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>(l), <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a>(s)
<a name="l00908"></a>00908         { }
<a name="l00909"></a>00909 <span class="comment"></span>
<a name="l00910"></a>00910 <span class="comment">        /// Copy-constructor from a mutable iterator</span>
<a name="l00911"></a><a class="code" href="a00020.html#a971eb197745a946766bd4dc9febc9be4">00911</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00020.html#a037a981f590f5cf648a66f84a37a8e01" title="Default-Constructor of a reverse iterator.">reverse_iterator</a>(<span class="keyword">const</span> <a class="code" href="a00016.html" title="STL-like iterator object for B+ tree items.">iterator</a> &amp;it)
<a name="l00912"></a>00912             : <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>(it.<a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>), <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a>(it.<a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a>)
<a name="l00913"></a>00913         { }
<a name="l00914"></a>00914 <span class="comment"></span>
<a name="l00915"></a>00915 <span class="comment">        /// Dereference the iterator, this is not a value_type&amp; because key and</span>
<a name="l00916"></a>00916 <span class="comment">        /// value are not stored together</span>
<a name="l00917"></a><a class="code" href="a00020.html#ac4ab8274575df053e010e4ce7f66ef96">00917</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00020.html#aafabdbb26269c865eff146d29d106d95" title="Reference to the value_type. STL required.">reference</a> <a class="code" href="a00020.html#ac4ab8274575df053e010e4ce7f66ef96" title="Dereference the iterator, this is not a value_type&amp; because key and value are not stored together...">operator*</a>()<span class="keyword"> const</span>
<a name="l00918"></a>00918 <span class="keyword">        </span>{
<a name="l00919"></a>00919             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> &gt; 0);
<a name="l00920"></a>00920             <a class="code" href="a00020.html#a63ccdf692264f526659802b5326bc13c" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a> = <a class="code" href="a00001.html#a76bd9fc84f712e0d962314c1d6a188ce" title="Using template specialization select the correct converter used by the iterators.">pair_to_value_type</a>()( <a class="code" href="a00020.html#a29586b9555247c18a0bbc963077277cc" title="The pair type of the btree.">pair_type</a>(<a class="code" href="a00020.html#af080cb064e66be74b06c471cdbb82f0b" title="Key of the current slot.">key</a>(),<a class="code" href="a00020.html#a913c74f0137024989f6ab3eb1568b961" title="Writable reference to the current data object.">data</a>()) );
<a name="l00921"></a>00921             <span class="keywordflow">return</span> <a class="code" href="a00020.html#a63ccdf692264f526659802b5326bc13c" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a>;
<a name="l00922"></a>00922         }
<a name="l00923"></a>00923 <span class="comment"></span>
<a name="l00924"></a>00924 <span class="comment">        /// Dereference the iterator. Do not use this if possible, use key()</span>
<a name="l00925"></a>00925 <span class="comment">        /// and data() instead. The B+ tree does not stored key and data</span>
<a name="l00926"></a>00926 <span class="comment">        /// together.</span>
<a name="l00927"></a><a class="code" href="a00020.html#a59e5d71e8750afe41bdebbf01dc2983c">00927</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00020.html#abec59d5ad25b0caaa3dbd19cb1e5c1b4" title="Pointer to the value_type. STL required.">pointer</a> <a class="code" href="a00020.html#a59e5d71e8750afe41bdebbf01dc2983c" title="Dereference the iterator.">operator-&gt;</a>()<span class="keyword"> const</span>
<a name="l00928"></a>00928 <span class="keyword">        </span>{
<a name="l00929"></a>00929             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> &gt; 0);
<a name="l00930"></a>00930             <a class="code" href="a00020.html#a63ccdf692264f526659802b5326bc13c" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a> = <a class="code" href="a00001.html#a76bd9fc84f712e0d962314c1d6a188ce" title="Using template specialization select the correct converter used by the iterators.">pair_to_value_type</a>()( <a class="code" href="a00020.html#a29586b9555247c18a0bbc963077277cc" title="The pair type of the btree.">pair_type</a>(<a class="code" href="a00020.html#af080cb064e66be74b06c471cdbb82f0b" title="Key of the current slot.">key</a>(),<a class="code" href="a00020.html#a913c74f0137024989f6ab3eb1568b961" title="Writable reference to the current data object.">data</a>()) );
<a name="l00931"></a>00931             <span class="keywordflow">return</span> &amp;<a class="code" href="a00020.html#a63ccdf692264f526659802b5326bc13c" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a>;
<a name="l00932"></a>00932         }
<a name="l00933"></a>00933 <span class="comment"></span>
<a name="l00934"></a>00934 <span class="comment">        /// Key of the current slot</span>
<a name="l00935"></a><a class="code" href="a00020.html#af080cb064e66be74b06c471cdbb82f0b">00935</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="a00020.html#a6c51c511a728641235b1b766d370d947" title="The key type of the btree. Returned by key().">key_type</a>&amp; <a class="code" href="a00020.html#af080cb064e66be74b06c471cdbb82f0b" title="Key of the current slot.">key</a>()<span class="keyword"> const</span>
<a name="l00936"></a>00936 <span class="keyword">        </span>{
<a name="l00937"></a>00937             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> &gt; 0);
<a name="l00938"></a>00938             <span class="keywordflow">return</span> <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#af92e519f605cf7b7aae74f6f5d6c8bd8" title="Keys of children or data pointers.">slotkey</a>[<a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> - 1];
<a name="l00939"></a>00939         }
<a name="l00940"></a>00940 <span class="comment"></span>
<a name="l00941"></a>00941 <span class="comment">        /// Writable reference to the current data object</span>
<a name="l00942"></a><a class="code" href="a00020.html#a913c74f0137024989f6ab3eb1568b961">00942</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00020.html#adbbb473dc39aa6939320a775270db73b" title="The data type of the btree. Returned by data().">data_type</a>&amp; <a class="code" href="a00020.html#a913c74f0137024989f6ab3eb1568b961" title="Writable reference to the current data object.">data</a>()<span class="keyword"> const</span>
<a name="l00943"></a>00943 <span class="keyword">        </span>{
<a name="l00944"></a>00944             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> &gt; 0);
<a name="l00945"></a>00945             <span class="keywordflow">return</span> <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#ad4fc245fe5b90c21dec069792c3f7432" title="Array of data.">slotdata</a>[<a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a> ? 0 : <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a>-1];
<a name="l00946"></a>00946         }
<a name="l00947"></a>00947 <span class="comment"></span>
<a name="l00948"></a>00948 <span class="comment">        /// Prefix++ advance the iterator to the next slot</span>
<a name="l00949"></a><a class="code" href="a00020.html#a83c5c8552459da2b6047762874aec039">00949</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span>&amp; <a class="code" href="a00020.html#a83c5c8552459da2b6047762874aec039" title="Prefix++ advance the iterator to the next slot.">operator++</a>()
<a name="l00950"></a>00950         {
<a name="l00951"></a>00951             <span class="keywordflow">if</span> (<a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> &gt; 1) {
<a name="l00952"></a>00952                 --<a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a>;
<a name="l00953"></a>00953             }
<a name="l00954"></a>00954             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> != NULL) {
<a name="l00955"></a>00955                 <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a>;
<a name="l00956"></a>00956                 <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> = <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l00957"></a>00957             }
<a name="l00958"></a>00958             <span class="keywordflow">else</span> {
<a name="l00959"></a>00959                 <span class="comment">// this is begin() == rend()</span>
<a name="l00960"></a>00960                 <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> = 0;
<a name="l00961"></a>00961             }
<a name="l00962"></a>00962 
<a name="l00963"></a>00963             <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00964"></a>00964         }
<a name="l00965"></a>00965 <span class="comment"></span>
<a name="l00966"></a>00966 <span class="comment">        /// Postfix++ advance the iterator to the next slot</span>
<a name="l00967"></a><a class="code" href="a00020.html#a618f9236ea8724f4d2051e81e5dfab79">00967</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span> <a class="code" href="a00020.html#a83c5c8552459da2b6047762874aec039" title="Prefix++ advance the iterator to the next slot.">operator++</a>(<span class="keywordtype">int</span>)
<a name="l00968"></a>00968         {
<a name="l00969"></a>00969             <span class="keyword">self</span> tmp = *<span class="keyword">this</span>;   <span class="comment">// copy ourselves</span>
<a name="l00970"></a>00970 
<a name="l00971"></a>00971             <span class="keywordflow">if</span> (<a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> &gt; 1) {
<a name="l00972"></a>00972                 --<a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a>;
<a name="l00973"></a>00973             }
<a name="l00974"></a>00974             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> != NULL) {
<a name="l00975"></a>00975                 <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a>;
<a name="l00976"></a>00976                 <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> = <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l00977"></a>00977             }
<a name="l00978"></a>00978             <span class="keywordflow">else</span> {
<a name="l00979"></a>00979                 <span class="comment">// this is begin() == rend()</span>
<a name="l00980"></a>00980                 <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> = 0;
<a name="l00981"></a>00981             }
<a name="l00982"></a>00982 
<a name="l00983"></a>00983             <span class="keywordflow">return</span> tmp;
<a name="l00984"></a>00984         }
<a name="l00985"></a>00985 <span class="comment"></span>
<a name="l00986"></a>00986 <span class="comment">        /// Prefix-- backstep the iterator to the last slot</span>
<a name="l00987"></a><a class="code" href="a00020.html#a9cc89c7f58ea9856d57d2f0c230d0ade">00987</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span>&amp; <a class="code" href="a00020.html#a9cc89c7f58ea9856d57d2f0c230d0ade" title="Prefix-- backstep the iterator to the last slot.">operator--</a>()
<a name="l00988"></a>00988         {
<a name="l00989"></a>00989             <span class="keywordflow">if</span> (currslot &lt; currnode-&gt;slotuse) {
<a name="l00990"></a>00990                 ++<a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a>;
<a name="l00991"></a>00991             }
<a name="l00992"></a>00992             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a> != NULL) {
<a name="l00993"></a>00993                 <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a>;
<a name="l00994"></a>00994                 <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> = 1;
<a name="l00995"></a>00995             }
<a name="l00996"></a>00996             <span class="keywordflow">else</span> {
<a name="l00997"></a>00997                 <span class="comment">// this is end() == rbegin()</span>
<a name="l00998"></a>00998                 <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> = <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l00999"></a>00999             }
<a name="l01000"></a>01000 
<a name="l01001"></a>01001             <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01002"></a>01002         }
<a name="l01003"></a>01003 <span class="comment"></span>
<a name="l01004"></a>01004 <span class="comment">        /// Postfix-- backstep the iterator to the last slot</span>
<a name="l01005"></a><a class="code" href="a00020.html#a0a9ee91c333e89bcf34c2a46d2f2fb33">01005</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span> <a class="code" href="a00020.html#a9cc89c7f58ea9856d57d2f0c230d0ade" title="Prefix-- backstep the iterator to the last slot.">operator--</a>(<span class="keywordtype">int</span>)
<a name="l01006"></a>01006         {
<a name="l01007"></a>01007             <span class="keyword">self</span> tmp = *<span class="keyword">this</span>;   <span class="comment">// copy ourselves</span>
<a name="l01008"></a>01008 
<a name="l01009"></a>01009             <span class="keywordflow">if</span> (currslot &lt; currnode-&gt;slotuse) {
<a name="l01010"></a>01010                 ++<a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a>;
<a name="l01011"></a>01011             }
<a name="l01012"></a>01012             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a> != NULL) {
<a name="l01013"></a>01013                 <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a>;
<a name="l01014"></a>01014                 <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> = 1;
<a name="l01015"></a>01015             }
<a name="l01016"></a>01016             <span class="keywordflow">else</span> {
<a name="l01017"></a>01017                 <span class="comment">// this is end() == rbegin()</span>
<a name="l01018"></a>01018                 <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a> = <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l01019"></a>01019             }
<a name="l01020"></a>01020 
<a name="l01021"></a>01021             <span class="keywordflow">return</span> tmp;
<a name="l01022"></a>01022         }
<a name="l01023"></a>01023 <span class="comment"></span>
<a name="l01024"></a>01024 <span class="comment">        /// Equality of iterators</span>
<a name="l01025"></a><a class="code" href="a00020.html#a21842a65d08ee94fff82572f57d731da">01025</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00020.html#a21842a65d08ee94fff82572f57d731da" title="Equality of iterators.">operator==</a>(<span class="keyword">const</span> <span class="keyword">self</span>&amp; x)<span class="keyword"> const</span>
<a name="l01026"></a>01026 <span class="keyword">        </span>{
<a name="l01027"></a>01027             <span class="keywordflow">return</span> (x.currnode == <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>) &amp;&amp; (x.currslot == <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a>);
<a name="l01028"></a>01028         }
<a name="l01029"></a>01029 <span class="comment"></span>
<a name="l01030"></a>01030 <span class="comment">        /// Inequality of iterators</span>
<a name="l01031"></a><a class="code" href="a00020.html#aec652edaceca04b39dc8154b7ff271fb">01031</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00020.html#aec652edaceca04b39dc8154b7ff271fb" title="Inequality of iterators.">operator!=</a>(<span class="keyword">const</span> <span class="keyword">self</span>&amp; x)<span class="keyword"> const</span>
<a name="l01032"></a>01032 <span class="keyword">        </span>{
<a name="l01033"></a>01033             <span class="keywordflow">return</span> (x.currnode != <a class="code" href="a00020.html#aa0d19039b62c1900832061ff5ffc0cdd" title="The currently referenced leaf node of the tree.">currnode</a>) || (x.currslot != <a class="code" href="a00020.html#a18093d258964badd66e623908a699774" title="One slot past the current key/data slot referenced.">currslot</a>);
<a name="l01034"></a>01034         }
<a name="l01035"></a>01035     };
<a name="l01036"></a>01036 <span class="comment"></span>
<a name="l01037"></a>01037 <span class="comment">    /// STL-like read-only reverse iterator object for B+ tree items. The</span>
<a name="l01038"></a>01038 <span class="comment">    /// iterator points to a specific slot number in a leaf.</span>
<a name="l01039"></a><a class="code" href="a00011.html">01039</a> <span class="comment"></span>    <span class="keyword">class </span><a class="code" href="a00011.html" title="STL-like read-only reverse iterator object for B+ tree items.">const_reverse_iterator</a>
<a name="l01040"></a>01040     {
<a name="l01041"></a>01041     <span class="keyword">public</span>:
<a name="l01042"></a>01042         <span class="comment">// *** Types</span>
<a name="l01043"></a>01043 <span class="comment"></span>
<a name="l01044"></a>01044 <span class="comment">        /// The key type of the btree. Returned by key().</span>
<a name="l01045"></a><a class="code" href="a00011.html#a70e0109ac9bbb992d8cd719e46a823f7">01045</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">btree::key_type</a>                <a class="code" href="a00011.html#a70e0109ac9bbb992d8cd719e46a823f7" title="The key type of the btree. Returned by key().">key_type</a>;
<a name="l01046"></a>01046 <span class="comment"></span>
<a name="l01047"></a>01047 <span class="comment">        /// The data type of the btree. Returned by data().</span>
<a name="l01048"></a><a class="code" href="a00011.html#a9c8e143f60ffc4737bcd5aff64056b8b">01048</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">btree::data_type</a>               <a class="code" href="a00011.html#a9c8e143f60ffc4737bcd5aff64056b8b" title="The data type of the btree. Returned by data().">data_type</a>;
<a name="l01049"></a>01049 <span class="comment"></span>
<a name="l01050"></a>01050 <span class="comment">        /// The value type of the btree. Returned by operator*().</span>
<a name="l01051"></a><a class="code" href="a00011.html#acc930672f2eec7f6415ff83d4509ac05">01051</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">btree::value_type</a>              <a class="code" href="a00011.html#acc930672f2eec7f6415ff83d4509ac05" title="The value type of the btree. Returned by operator*().">value_type</a>;
<a name="l01052"></a>01052 <span class="comment"></span>
<a name="l01053"></a>01053 <span class="comment">        /// The pair type of the btree.</span>
<a name="l01054"></a><a class="code" href="a00011.html#aab286faf1eb3ae1b6468fe8e9a75f3b1">01054</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00001.html#a2cddd431e50047766f45902b9f6f5c31" title="The pair of key_type and data_type, this may be different from value_type.">btree::pair_type</a>               <a class="code" href="a00011.html#aab286faf1eb3ae1b6468fe8e9a75f3b1" title="The pair type of the btree.">pair_type</a>;
<a name="l01055"></a>01055 <span class="comment"></span>
<a name="l01056"></a>01056 <span class="comment">        /// Reference to the value_type. STL required.</span>
<a name="l01057"></a><a class="code" href="a00011.html#a348f4ac60e9b98e52dd4a9eb7a583aae">01057</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">const</span> <a class="code" href="a00011.html#acc930672f2eec7f6415ff83d4509ac05" title="The value type of the btree. Returned by operator*().">value_type</a>&amp;               <a class="code" href="a00011.html#a348f4ac60e9b98e52dd4a9eb7a583aae" title="Reference to the value_type. STL required.">reference</a>;
<a name="l01058"></a>01058 <span class="comment"></span>
<a name="l01059"></a>01059 <span class="comment">        /// Pointer to the value_type. STL required.</span>
<a name="l01060"></a><a class="code" href="a00011.html#ae4738f49ed44440ea435caf233b0f9e4">01060</a> <span class="comment"></span>        <span class="keyword">typedef</span> <span class="keyword">const</span> <a class="code" href="a00011.html#acc930672f2eec7f6415ff83d4509ac05" title="The value type of the btree. Returned by operator*().">value_type</a>*               <a class="code" href="a00011.html#ae4738f49ed44440ea435caf233b0f9e4" title="Pointer to the value_type. STL required.">pointer</a>;
<a name="l01061"></a>01061 <span class="comment"></span>
<a name="l01062"></a>01062 <span class="comment">        /// STL-magic iterator category</span>
<a name="l01063"></a><a class="code" href="a00011.html#a32a22b72cec700c50bbd3d39aa7b08e6">01063</a> <span class="comment"></span>        <span class="keyword">typedef</span> std::bidirectional_iterator_tag         <a class="code" href="a00011.html#a32a22b72cec700c50bbd3d39aa7b08e6" title="STL-magic iterator category.">iterator_category</a>;
<a name="l01064"></a>01064 <span class="comment"></span>
<a name="l01065"></a>01065 <span class="comment">        /// STL-magic</span>
<a name="l01066"></a><a class="code" href="a00011.html#a16239c36756ab6f302cae6c81f546435">01066</a> <span class="comment"></span>        <span class="keyword">typedef</span> ptrdiff_t               <a class="code" href="a00011.html#a16239c36756ab6f302cae6c81f546435" title="STL-magic.">difference_type</a>;
<a name="l01067"></a>01067 <span class="comment"></span>
<a name="l01068"></a>01068 <span class="comment">        /// Our own type</span>
<a name="l01069"></a><a class="code" href="a00011.html#a49f760734d01e4d077b81d7bfb50d249">01069</a> <span class="comment"></span>        <span class="keyword">typedef</span> <a class="code" href="a00011.html" title="STL-like read-only reverse iterator object for B+ tree items.">const_reverse_iterator</a>  <span class="keyword">self</span>;
<a name="l01070"></a>01070 
<a name="l01071"></a>01071     <span class="keyword">private</span>:
<a name="l01072"></a>01072         <span class="comment">// *** Members</span>
<a name="l01073"></a>01073 <span class="comment"></span>
<a name="l01074"></a>01074 <span class="comment">        /// The currently referenced leaf node of the tree</span>
<a name="l01075"></a><a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1">01075</a> <span class="comment"></span>        <span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="a00017.html" title="Extended structure of a leaf node in memory.">btree::leaf_node</a>*        <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>;
<a name="l01076"></a>01076 <span class="comment"></span>
<a name="l01077"></a>01077 <span class="comment">        /// One slot past the current key/data slot referenced.</span>
<a name="l01078"></a><a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0">01078</a> <span class="comment"></span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>                          <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>;
<a name="l01079"></a>01079 <span class="comment"></span>
<a name="l01080"></a>01080 <span class="comment">        /// Friendly to the const_iterator, so it may access the two data items</span>
<a name="l01081"></a>01081 <span class="comment">        /// directly.</span>
<a name="l01082"></a><a class="code" href="a00011.html#af0a70641f2216cc31420487a62dd3b0d">01082</a> <span class="comment"></span>        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00020.html" title="STL-like mutable reverse iterator object for B+ tree items.">reverse_iterator</a>;
<a name="l01083"></a>01083 <span class="comment"></span>
<a name="l01084"></a>01084 <span class="comment">        /// Evil! A temporary value_type to STL-correctly deliver operator* and</span>
<a name="l01085"></a>01085 <span class="comment">        /// operator-&gt;</span>
<a name="l01086"></a><a class="code" href="a00011.html#a61c5865ccc405cfdfbc4c4a5c6d56159">01086</a> <span class="comment"></span>        <span class="keyword">mutable</span> <a class="code" href="a00011.html#acc930672f2eec7f6415ff83d4509ac05" title="The value type of the btree. Returned by operator*().">value_type</a>              <a class="code" href="a00011.html#a61c5865ccc405cfdfbc4c4a5c6d56159" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a>;
<a name="l01087"></a>01087 
<a name="l01088"></a>01088         <span class="comment">// The macro BTREE_FRIENDS can be used by outside class to access the B+</span>
<a name="l01089"></a>01089         <span class="comment">// tree internals. This was added for wxBTreeDemo to be able to draw the</span>
<a name="l01090"></a>01090         <span class="comment">// tree.</span>
<a name="l01091"></a>01091         <a class="code" href="a00026.html#aec07a93b351ce398f789007a441a4320" title="The macro BTREE_FRIENDS can be used by outside class to access the B+ tree internals.">BTREE_FRIENDS</a>
<a name="l01092"></a>01092 
<a name="l01093"></a>01093     <span class="keyword">public</span>:
<a name="l01094"></a>01094         <span class="comment">// *** Methods</span>
<a name="l01095"></a>01095 <span class="comment"></span>
<a name="l01096"></a>01096 <span class="comment">        /// Default-Constructor of a const reverse iterator</span>
<a name="l01097"></a><a class="code" href="a00011.html#af3bb1866679e03b44091e60297eb3a07">01097</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00011.html#af3bb1866679e03b44091e60297eb3a07" title="Default-Constructor of a const reverse iterator.">const_reverse_iterator</a>()
<a name="l01098"></a>01098             : <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>(NULL), <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>(0)
<a name="l01099"></a>01099         { }
<a name="l01100"></a>01100 <span class="comment"></span>
<a name="l01101"></a>01101 <span class="comment">        /// Initializing-Constructor of a const reverse iterator</span>
<a name="l01102"></a><a class="code" href="a00011.html#a406c6261e15547799c5354469bd97bc1">01102</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00011.html#af3bb1866679e03b44091e60297eb3a07" title="Default-Constructor of a const reverse iterator.">const_reverse_iterator</a>(<span class="keyword">const</span> <span class="keyword">typename</span> <a class="code" href="a00017.html" title="Extended structure of a leaf node in memory.">btree::leaf_node</a> *l, <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> s)
<a name="l01103"></a>01103             : <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>(l), <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>(s)
<a name="l01104"></a>01104         { }
<a name="l01105"></a>01105 <span class="comment"></span>
<a name="l01106"></a>01106 <span class="comment">        /// Copy-constructor from a mutable iterator</span>
<a name="l01107"></a><a class="code" href="a00011.html#aca6caede1c4a70a0ba6374374e8d23b4">01107</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00011.html#af3bb1866679e03b44091e60297eb3a07" title="Default-Constructor of a const reverse iterator.">const_reverse_iterator</a>(<span class="keyword">const</span> <a class="code" href="a00016.html" title="STL-like iterator object for B+ tree items.">iterator</a> &amp;it)
<a name="l01108"></a>01108             : <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>(it.<a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>), <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>(it.<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>)
<a name="l01109"></a>01109         { }
<a name="l01110"></a>01110 <span class="comment"></span>
<a name="l01111"></a>01111 <span class="comment">        /// Copy-constructor from a const iterator</span>
<a name="l01112"></a><a class="code" href="a00011.html#a349eb4703fe072a9f7391fbf690227c5">01112</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00011.html#af3bb1866679e03b44091e60297eb3a07" title="Default-Constructor of a const reverse iterator.">const_reverse_iterator</a>(<span class="keyword">const</span> <a class="code" href="a00010.html" title="STL-like read-only iterator object for B+ tree items.">const_iterator</a> &amp;it)
<a name="l01113"></a>01113             : <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>(it.<a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>), <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>(it.<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>)
<a name="l01114"></a>01114         { }
<a name="l01115"></a>01115 <span class="comment"></span>
<a name="l01116"></a>01116 <span class="comment">        /// Copy-constructor from a mutable reverse iterator</span>
<a name="l01117"></a><a class="code" href="a00011.html#a28c296620454764d5f4122bbba635fe8">01117</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00011.html#af3bb1866679e03b44091e60297eb3a07" title="Default-Constructor of a const reverse iterator.">const_reverse_iterator</a>(<span class="keyword">const</span> <a class="code" href="a00020.html" title="STL-like mutable reverse iterator object for B+ tree items.">reverse_iterator</a> &amp;it)
<a name="l01118"></a>01118             : <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>(it.<a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>), <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>(it.<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>)
<a name="l01119"></a>01119         { }
<a name="l01120"></a>01120 <span class="comment"></span>
<a name="l01121"></a>01121 <span class="comment">        /// Dereference the iterator. Do not use this if possible, use key()</span>
<a name="l01122"></a>01122 <span class="comment">        /// and data() instead. The B+ tree does not stored key and data</span>
<a name="l01123"></a>01123 <span class="comment">        /// together.</span>
<a name="l01124"></a><a class="code" href="a00011.html#ab3e68e6e7fb69e17532b6bcaa6cde4fd">01124</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00011.html#a348f4ac60e9b98e52dd4a9eb7a583aae" title="Reference to the value_type. STL required.">reference</a> <a class="code" href="a00011.html#ab3e68e6e7fb69e17532b6bcaa6cde4fd" title="Dereference the iterator.">operator*</a>()<span class="keyword"> const</span>
<a name="l01125"></a>01125 <span class="keyword">        </span>{
<a name="l01126"></a>01126             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> &gt; 0);
<a name="l01127"></a>01127             <a class="code" href="a00011.html#a61c5865ccc405cfdfbc4c4a5c6d56159" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a> = <a class="code" href="a00001.html#a76bd9fc84f712e0d962314c1d6a188ce" title="Using template specialization select the correct converter used by the iterators.">pair_to_value_type</a>()( <a class="code" href="a00011.html#aab286faf1eb3ae1b6468fe8e9a75f3b1" title="The pair type of the btree.">pair_type</a>(<a class="code" href="a00011.html#a4ecc6fe88b07cd9f45636b45846ab205" title="Key of the current slot.">key</a>(),<a class="code" href="a00011.html#abb2dda2d282567f7f45d47e89b78163d" title="Read-only reference to the current data object.">data</a>()) );
<a name="l01128"></a>01128             <span class="keywordflow">return</span> <a class="code" href="a00011.html#a61c5865ccc405cfdfbc4c4a5c6d56159" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a>;
<a name="l01129"></a>01129         }
<a name="l01130"></a>01130 <span class="comment"></span>
<a name="l01131"></a>01131 <span class="comment">        /// Dereference the iterator. Do not use this if possible, use key()</span>
<a name="l01132"></a>01132 <span class="comment">        /// and data() instead. The B+ tree does not stored key and data</span>
<a name="l01133"></a>01133 <span class="comment">        /// together.</span>
<a name="l01134"></a><a class="code" href="a00011.html#a370933a996011f9b7562b617dbbdd6d4">01134</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00011.html#ae4738f49ed44440ea435caf233b0f9e4" title="Pointer to the value_type. STL required.">pointer</a> <a class="code" href="a00011.html#a370933a996011f9b7562b617dbbdd6d4" title="Dereference the iterator.">operator-&gt;</a>()<span class="keyword"> const</span>
<a name="l01135"></a>01135 <span class="keyword">        </span>{
<a name="l01136"></a>01136             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> &gt; 0);
<a name="l01137"></a>01137             <a class="code" href="a00011.html#a61c5865ccc405cfdfbc4c4a5c6d56159" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a> = <a class="code" href="a00001.html#a76bd9fc84f712e0d962314c1d6a188ce" title="Using template specialization select the correct converter used by the iterators.">pair_to_value_type</a>()( <a class="code" href="a00011.html#aab286faf1eb3ae1b6468fe8e9a75f3b1" title="The pair type of the btree.">pair_type</a>(<a class="code" href="a00011.html#a4ecc6fe88b07cd9f45636b45846ab205" title="Key of the current slot.">key</a>(),<a class="code" href="a00011.html#abb2dda2d282567f7f45d47e89b78163d" title="Read-only reference to the current data object.">data</a>()) );
<a name="l01138"></a>01138             <span class="keywordflow">return</span> &amp;<a class="code" href="a00011.html#a61c5865ccc405cfdfbc4c4a5c6d56159" title="Evil! A temporary value_type to STL-correctly deliver operator* and operator-&gt;">temp_value</a>;
<a name="l01139"></a>01139         }
<a name="l01140"></a>01140 <span class="comment"></span>
<a name="l01141"></a>01141 <span class="comment">        /// Key of the current slot</span>
<a name="l01142"></a><a class="code" href="a00011.html#a4ecc6fe88b07cd9f45636b45846ab205">01142</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="a00011.html#a70e0109ac9bbb992d8cd719e46a823f7" title="The key type of the btree. Returned by key().">key_type</a>&amp; <a class="code" href="a00011.html#a4ecc6fe88b07cd9f45636b45846ab205" title="Key of the current slot.">key</a>()<span class="keyword"> const</span>
<a name="l01143"></a>01143 <span class="keyword">        </span>{
<a name="l01144"></a>01144             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> &gt; 0);
<a name="l01145"></a>01145             <span class="keywordflow">return</span> <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#af92e519f605cf7b7aae74f6f5d6c8bd8" title="Keys of children or data pointers.">slotkey</a>[<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> - 1];
<a name="l01146"></a>01146         }
<a name="l01147"></a>01147 <span class="comment"></span>
<a name="l01148"></a>01148 <span class="comment">        /// Read-only reference to the current data object</span>
<a name="l01149"></a><a class="code" href="a00011.html#abb2dda2d282567f7f45d47e89b78163d">01149</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="a00011.html#a9c8e143f60ffc4737bcd5aff64056b8b" title="The data type of the btree. Returned by data().">data_type</a>&amp; <a class="code" href="a00011.html#abb2dda2d282567f7f45d47e89b78163d" title="Read-only reference to the current data object.">data</a>()<span class="keyword"> const</span>
<a name="l01150"></a>01150 <span class="keyword">        </span>{
<a name="l01151"></a>01151             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> &gt; 0);
<a name="l01152"></a>01152             <span class="keywordflow">return</span> <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#ad4fc245fe5b90c21dec069792c3f7432" title="Array of data.">slotdata</a>[<a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a> ? 0 : <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>-1];
<a name="l01153"></a>01153         }
<a name="l01154"></a>01154 <span class="comment"></span>
<a name="l01155"></a>01155 <span class="comment">        /// Prefix++ advance the iterator to the previous slot</span>
<a name="l01156"></a><a class="code" href="a00011.html#a3d4d624e2c4ddf7f4de6e48f534fdd26">01156</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span>&amp; <a class="code" href="a00011.html#a3d4d624e2c4ddf7f4de6e48f534fdd26" title="Prefix++ advance the iterator to the previous slot.">operator++</a>()
<a name="l01157"></a>01157         {
<a name="l01158"></a>01158             <span class="keywordflow">if</span> (<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> &gt; 1) {
<a name="l01159"></a>01159                 --<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>;
<a name="l01160"></a>01160             }
<a name="l01161"></a>01161             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> != NULL) {
<a name="l01162"></a>01162                 <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a>;
<a name="l01163"></a>01163                 <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> = <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l01164"></a>01164             }
<a name="l01165"></a>01165             <span class="keywordflow">else</span> {
<a name="l01166"></a>01166                 <span class="comment">// this is begin() == rend()</span>
<a name="l01167"></a>01167                 <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> = 0;
<a name="l01168"></a>01168             }
<a name="l01169"></a>01169 
<a name="l01170"></a>01170             <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01171"></a>01171         }
<a name="l01172"></a>01172 <span class="comment"></span>
<a name="l01173"></a>01173 <span class="comment">        /// Postfix++ advance the iterator to the previous slot</span>
<a name="l01174"></a><a class="code" href="a00011.html#adef1f00061b420c3920886bbbfeb6c26">01174</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span> <a class="code" href="a00011.html#a3d4d624e2c4ddf7f4de6e48f534fdd26" title="Prefix++ advance the iterator to the previous slot.">operator++</a>(<span class="keywordtype">int</span>)
<a name="l01175"></a>01175         {
<a name="l01176"></a>01176             <span class="keyword">self</span> tmp = *<span class="keyword">this</span>;   <span class="comment">// copy ourselves</span>
<a name="l01177"></a>01177 
<a name="l01178"></a>01178             <span class="keywordflow">if</span> (<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> &gt; 1) {
<a name="l01179"></a>01179                 --<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>;
<a name="l01180"></a>01180             }
<a name="l01181"></a>01181             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> != NULL) {
<a name="l01182"></a>01182                 <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a>;
<a name="l01183"></a>01183                 <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> = <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l01184"></a>01184             }
<a name="l01185"></a>01185             <span class="keywordflow">else</span> {
<a name="l01186"></a>01186                 <span class="comment">// this is begin() == rend()</span>
<a name="l01187"></a>01187                 <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> = 0;
<a name="l01188"></a>01188             }
<a name="l01189"></a>01189 
<a name="l01190"></a>01190             <span class="keywordflow">return</span> tmp;
<a name="l01191"></a>01191         }
<a name="l01192"></a>01192 <span class="comment"></span>
<a name="l01193"></a>01193 <span class="comment">        /// Prefix-- backstep the iterator to the next slot</span>
<a name="l01194"></a><a class="code" href="a00011.html#a19b97b3c22c5efe9aae998ad436779c8">01194</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span>&amp; <a class="code" href="a00011.html#a19b97b3c22c5efe9aae998ad436779c8" title="Prefix-- backstep the iterator to the next slot.">operator--</a>()
<a name="l01195"></a>01195         {
<a name="l01196"></a>01196             <span class="keywordflow">if</span> (currslot &lt; currnode-&gt;slotuse) {
<a name="l01197"></a>01197                 ++<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>;
<a name="l01198"></a>01198             }
<a name="l01199"></a>01199             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a> != NULL) {
<a name="l01200"></a>01200                 <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a>;
<a name="l01201"></a>01201                 <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> = 1;
<a name="l01202"></a>01202             }
<a name="l01203"></a>01203             <span class="keywordflow">else</span> {
<a name="l01204"></a>01204                 <span class="comment">// this is end() == rbegin()</span>
<a name="l01205"></a>01205                 <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> = <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l01206"></a>01206             }
<a name="l01207"></a>01207 
<a name="l01208"></a>01208             <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l01209"></a>01209         }
<a name="l01210"></a>01210 <span class="comment"></span>
<a name="l01211"></a>01211 <span class="comment">        /// Postfix-- backstep the iterator to the next slot</span>
<a name="l01212"></a><a class="code" href="a00011.html#ab38fc2017a87598e61cdc5abe4a314f7">01212</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keyword">self</span> <a class="code" href="a00011.html#a19b97b3c22c5efe9aae998ad436779c8" title="Prefix-- backstep the iterator to the next slot.">operator--</a>(<span class="keywordtype">int</span>)
<a name="l01213"></a>01213         {
<a name="l01214"></a>01214             <span class="keyword">self</span> tmp = *<span class="keyword">this</span>;   <span class="comment">// copy ourselves</span>
<a name="l01215"></a>01215 
<a name="l01216"></a>01216             <span class="keywordflow">if</span> (currslot &lt; currnode-&gt;slotuse) {
<a name="l01217"></a>01217                 ++<a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>;
<a name="l01218"></a>01218             }
<a name="l01219"></a>01219             <span class="keywordflow">else</span> <span class="keywordflow">if</span> (<a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a> != NULL) {
<a name="l01220"></a>01220                 <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a> = <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a>;
<a name="l01221"></a>01221                 <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> = 1;
<a name="l01222"></a>01222             }
<a name="l01223"></a>01223             <span class="keywordflow">else</span> {
<a name="l01224"></a>01224                 <span class="comment">// this is end() == rbegin()</span>
<a name="l01225"></a>01225                 <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a> = <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l01226"></a>01226             }
<a name="l01227"></a>01227 
<a name="l01228"></a>01228             <span class="keywordflow">return</span> tmp;
<a name="l01229"></a>01229         }
<a name="l01230"></a>01230 <span class="comment"></span>
<a name="l01231"></a>01231 <span class="comment">        /// Equality of iterators</span>
<a name="l01232"></a><a class="code" href="a00011.html#a04440b5128f77cd8b5ded1755ee02f0a">01232</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00011.html#a04440b5128f77cd8b5ded1755ee02f0a" title="Equality of iterators.">operator==</a>(<span class="keyword">const</span> <span class="keyword">self</span>&amp; x)<span class="keyword"> const</span>
<a name="l01233"></a>01233 <span class="keyword">        </span>{
<a name="l01234"></a>01234             <span class="keywordflow">return</span> (x.currnode == <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>) &amp;&amp; (x.currslot == <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>);
<a name="l01235"></a>01235         }
<a name="l01236"></a>01236 <span class="comment"></span>
<a name="l01237"></a>01237 <span class="comment">        /// Inequality of iterators</span>
<a name="l01238"></a><a class="code" href="a00011.html#a39a768f4e4691446178064dfbfbaef5a">01238</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00011.html#a39a768f4e4691446178064dfbfbaef5a" title="Inequality of iterators.">operator!=</a>(<span class="keyword">const</span> <span class="keyword">self</span>&amp; x)<span class="keyword"> const</span>
<a name="l01239"></a>01239 <span class="keyword">        </span>{
<a name="l01240"></a>01240             <span class="keywordflow">return</span> (x.currnode != <a class="code" href="a00011.html#ac0b50284d015657e6ea251bb695680f1" title="The currently referenced leaf node of the tree.">currnode</a>) || (x.currslot != <a class="code" href="a00011.html#a34ea10996939f11220a3ec2c8cd4d6a0" title="One slot past the current key/data slot referenced.">currslot</a>);
<a name="l01241"></a>01241         }
<a name="l01242"></a>01242     };
<a name="l01243"></a>01243 
<a name="l01244"></a>01244 <span class="keyword">public</span>:
<a name="l01245"></a>01245     <span class="comment">// *** Small Statistics Structure</span>
<a name="l01246"></a>01246 <span class="comment"></span>
<a name="l01247"></a>01247 <span class="comment">    /** A small struct containing basic statistics about the B+ tree. It can be</span>
<a name="l01248"></a>01248 <span class="comment">     * fetched using get_stats(). */</span>
<a name="l01249"></a><a class="code" href="a00021.html">01249</a>     <span class="keyword">struct </span><a class="code" href="a00021.html" title="A small struct containing basic statistics about the B+ tree.">tree_stats</a>
<a name="l01250"></a>01250     {<span class="comment"></span>
<a name="l01251"></a>01251 <span class="comment">        /// Number of items in the B+ tree</span>
<a name="l01252"></a><a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae">01252</a> <span class="comment"></span>        <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a>       <a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a>;
<a name="l01253"></a>01253 <span class="comment"></span>
<a name="l01254"></a>01254 <span class="comment">        /// Number of leaves in the B+ tree</span>
<a name="l01255"></a><a class="code" href="a00021.html#aa4d4f72b9a8f7a58424063aa1d4a1fcc">01255</a> <span class="comment"></span>        <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a>       <a class="code" href="a00021.html#aa4d4f72b9a8f7a58424063aa1d4a1fcc" title="Number of leaves in the B+ tree.">leaves</a>;
<a name="l01256"></a>01256 <span class="comment"></span>
<a name="l01257"></a>01257 <span class="comment">        /// Number of inner nodes in the B+ tree</span>
<a name="l01258"></a><a class="code" href="a00021.html#ab63b03a814b985680a46151fd9f59e17">01258</a> <span class="comment"></span>        <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a>       <a class="code" href="a00021.html#ab63b03a814b985680a46151fd9f59e17" title="Number of inner nodes in the B+ tree.">innernodes</a>;
<a name="l01259"></a>01259 <span class="comment"></span>
<a name="l01260"></a>01260 <span class="comment">        /// Base B+ tree parameter: The number of key/data slots in each leaf</span>
<a name="l01261"></a><a class="code" href="a00021.html#ae833639b01b1ee2893bdaa1d96e8a584">01261</a> <span class="comment"></span>        <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>     <a class="code" href="a00021.html#ae833639b01b1ee2893bdaa1d96e8a584" title="Base B+ tree parameter: The number of key/data slots in each leaf.">leafslots</a> = <a class="code" href="a00001.html#ac6c274f39fce8e14f6a881fc1da39cf8" title="Base B+ tree parameter: The number of key/data slots in each leaf.">btree_self::leafslotmax</a>;
<a name="l01262"></a>01262 <span class="comment"></span>
<a name="l01263"></a>01263 <span class="comment">        /// Base B+ tree parameter: The number of key slots in each inner node.</span>
<a name="l01264"></a><a class="code" href="a00021.html#a3811eb889b199b4b7aff549e85cc585b">01264</a> <span class="comment"></span>        <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>     <a class="code" href="a00021.html#a3811eb889b199b4b7aff549e85cc585b" title="Base B+ tree parameter: The number of key slots in each inner node.">innerslots</a> = <a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">btree_self::innerslotmax</a>;
<a name="l01265"></a>01265 <span class="comment"></span>
<a name="l01266"></a>01266 <span class="comment">        /// Zero initialized</span>
<a name="l01267"></a><a class="code" href="a00021.html#a3628ef3722433a7edfa727a188f7a455">01267</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00021.html#a3628ef3722433a7edfa727a188f7a455" title="Zero initialized.">tree_stats</a>()
<a name="l01268"></a>01268             : <a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a>(0),
<a name="l01269"></a>01269               <a class="code" href="a00021.html#aa4d4f72b9a8f7a58424063aa1d4a1fcc" title="Number of leaves in the B+ tree.">leaves</a>(0), <a class="code" href="a00021.html#ab63b03a814b985680a46151fd9f59e17" title="Number of inner nodes in the B+ tree.">innernodes</a>(0)
<a name="l01270"></a>01270         {
<a name="l01271"></a>01271         }
<a name="l01272"></a>01272 <span class="comment"></span>
<a name="l01273"></a>01273 <span class="comment">        /// Return the total number of nodes</span>
<a name="l01274"></a><a class="code" href="a00021.html#adf69b8f2b4df771fc5b1bd4e248a7a47">01274</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a> <a class="code" href="a00021.html#adf69b8f2b4df771fc5b1bd4e248a7a47" title="Return the total number of nodes.">nodes</a>()<span class="keyword"> const</span>
<a name="l01275"></a>01275 <span class="keyword">        </span>{
<a name="l01276"></a>01276             <span class="keywordflow">return</span> <a class="code" href="a00021.html#ab63b03a814b985680a46151fd9f59e17" title="Number of inner nodes in the B+ tree.">innernodes</a> + <a class="code" href="a00021.html#aa4d4f72b9a8f7a58424063aa1d4a1fcc" title="Number of leaves in the B+ tree.">leaves</a>;
<a name="l01277"></a>01277         }
<a name="l01278"></a>01278 <span class="comment"></span>
<a name="l01279"></a>01279 <span class="comment">        /// Return the average fill of leaves</span>
<a name="l01280"></a><a class="code" href="a00021.html#a9988e57cfa46a77f0bc02f67faab2d1f">01280</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">double</span> <a class="code" href="a00021.html#a9988e57cfa46a77f0bc02f67faab2d1f" title="Return the average fill of leaves.">avgfill_leaves</a>()<span class="keyword"> const</span>
<a name="l01281"></a>01281 <span class="keyword">        </span>{
<a name="l01282"></a>01282             <span class="keywordflow">return</span> <span class="keyword">static_cast&lt;</span><span class="keywordtype">double</span><span class="keyword">&gt;</span>(<a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a>) / (<a class="code" href="a00021.html#aa4d4f72b9a8f7a58424063aa1d4a1fcc" title="Number of leaves in the B+ tree.">leaves</a> * <a class="code" href="a00021.html#ae833639b01b1ee2893bdaa1d96e8a584" title="Base B+ tree parameter: The number of key/data slots in each leaf.">leafslots</a>);
<a name="l01283"></a>01283         }
<a name="l01284"></a>01284     };
<a name="l01285"></a>01285 
<a name="l01286"></a>01286 <span class="keyword">private</span>:
<a name="l01287"></a>01287     <span class="comment">// *** Tree Object Data Members</span>
<a name="l01288"></a>01288 <span class="comment"></span>
<a name="l01289"></a>01289 <span class="comment">    /// Pointer to the B+ tree&#39;s root node, either leaf or inner node</span>
<a name="l01290"></a><a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80">01290</a> <span class="comment"></span>    node*       <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>;
<a name="l01291"></a>01291 <span class="comment"></span>
<a name="l01292"></a>01292 <span class="comment">    /// Pointer to first leaf in the double linked leaf chain</span>
<a name="l01293"></a><a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa">01293</a> <span class="comment"></span>    leaf_node   *<a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>;
<a name="l01294"></a>01294 <span class="comment"></span>
<a name="l01295"></a>01295 <span class="comment">    /// Pointer to last leaf in the double linked leaf chain</span>
<a name="l01296"></a><a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7">01296</a> <span class="comment"></span>    leaf_node   *<a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>;
<a name="l01297"></a>01297 <span class="comment"></span>
<a name="l01298"></a>01298 <span class="comment">    /// Other small statistics about the B+ tree</span>
<a name="l01299"></a><a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3">01299</a> <span class="comment"></span>    tree_stats  <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>;
<a name="l01300"></a>01300 <span class="comment"></span>
<a name="l01301"></a>01301 <span class="comment">    /// Key comparison object. More comparison functions are generated from</span>
<a name="l01302"></a>01302 <span class="comment">    /// this &lt; relation.</span>
<a name="l01303"></a><a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1">01303</a> <span class="comment"></span>    <a class="code" href="a00001.html#a71413b8b8a1440539691a97f4cb61cae" title="Fourth template parameter: Key comparison function object.">key_compare</a> <a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>;
<a name="l01304"></a>01304 <span class="comment"></span>
<a name="l01305"></a>01305 <span class="comment">    /// Memory allocator.</span>
<a name="l01306"></a><a class="code" href="a00001.html#a36368c13e6be2feca3cbcc0aa8950b64">01306</a> <span class="comment"></span>    <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a> <a class="code" href="a00001.html#a36368c13e6be2feca3cbcc0aa8950b64" title="Memory allocator.">m_allocator</a>;
<a name="l01307"></a>01307 
<a name="l01308"></a>01308 <span class="keyword">public</span>:
<a name="l01309"></a>01309     <span class="comment">// *** Constructors and Destructor</span>
<a name="l01310"></a>01310 <span class="comment"></span>
<a name="l01311"></a>01311 <span class="comment">    /// Default constructor initializing an empty B+ tree with the standard key</span>
<a name="l01312"></a>01312 <span class="comment">    /// comparison function</span>
<a name="l01313"></a><a class="code" href="a00001.html#ab8d4b1a025d08beb515f5e3a8033deb4">01313</a> <span class="comment"></span>    <span class="keyword">explicit</span> <span class="keyword">inline</span> <a class="code" href="a00001.html#ab8d4b1a025d08beb515f5e3a8033deb4" title="Default constructor initializing an empty B+ tree with the standard key comparison function...">btree</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a> &amp;alloc = <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a>())
<a name="l01314"></a>01314         : <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>(NULL), <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>(NULL), <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>(NULL), <a class="code" href="a00001.html#a36368c13e6be2feca3cbcc0aa8950b64" title="Memory allocator.">m_allocator</a>(alloc)
<a name="l01315"></a>01315     {
<a name="l01316"></a>01316     }
<a name="l01317"></a>01317 <span class="comment"></span>
<a name="l01318"></a>01318 <span class="comment">    /// Constructor initializing an empty B+ tree with a special key</span>
<a name="l01319"></a>01319 <span class="comment">    /// comparison object</span>
<a name="l01320"></a><a class="code" href="a00001.html#a6601ec01fa386f754809f62baad7a112">01320</a> <span class="comment"></span>    <span class="keyword">explicit</span> <span class="keyword">inline</span> <a class="code" href="a00001.html#ab8d4b1a025d08beb515f5e3a8033deb4" title="Default constructor initializing an empty B+ tree with the standard key comparison function...">btree</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a71413b8b8a1440539691a97f4cb61cae" title="Fourth template parameter: Key comparison function object.">key_compare</a> &amp;kcf,
<a name="l01321"></a>01321                           <span class="keyword">const</span> <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a> &amp;alloc = <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a>())
<a name="l01322"></a>01322         : <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>(NULL), <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>(NULL), <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>(NULL),
<a name="l01323"></a>01323           <a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>(kcf), <a class="code" href="a00001.html#a36368c13e6be2feca3cbcc0aa8950b64" title="Memory allocator.">m_allocator</a>(alloc)
<a name="l01324"></a>01324     {
<a name="l01325"></a>01325     }
<a name="l01326"></a>01326 <span class="comment"></span>
<a name="l01327"></a>01327 <span class="comment">    /// Constructor initializing a B+ tree with the range [first,last). The</span>
<a name="l01328"></a>01328 <span class="comment">    /// range need not be sorted. To create a B+ tree from a sorted range, use</span>
<a name="l01329"></a>01329 <span class="comment">    /// bulk_load().</span>
<a name="l01330"></a>01330 <span class="comment"></span>    <span class="keyword">template</span> &lt;<span class="keyword">class</span> InputIterator&gt;
<a name="l01331"></a><a class="code" href="a00001.html#ad6c89387fa35b4724f9da5cfc91033f5">01331</a>     <span class="keyword">inline</span> <a class="code" href="a00001.html#ab8d4b1a025d08beb515f5e3a8033deb4" title="Default constructor initializing an empty B+ tree with the standard key comparison function...">btree</a>(InputIterator first, InputIterator last,
<a name="l01332"></a>01332                  <span class="keyword">const</span> <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a> &amp;alloc = <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a>())
<a name="l01333"></a>01333         : <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>(NULL), <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>(NULL), <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>(NULL), <a class="code" href="a00001.html#a36368c13e6be2feca3cbcc0aa8950b64" title="Memory allocator.">m_allocator</a>(alloc)
<a name="l01334"></a>01334     {
<a name="l01335"></a>01335         <a class="code" href="a00001.html#a29d3aa8b03d2def35a358aebb2853053" title="Attempt to insert a key/data pair into the B+ tree.">insert</a>(first, last);
<a name="l01336"></a>01336     }
<a name="l01337"></a>01337 <span class="comment"></span>
<a name="l01338"></a>01338 <span class="comment">    /// Constructor initializing a B+ tree with the range [first,last) and a</span>
<a name="l01339"></a>01339 <span class="comment">    /// special key comparison object.  The range need not be sorted. To create</span>
<a name="l01340"></a>01340 <span class="comment">    /// a B+ tree from a sorted range, use bulk_load().</span>
<a name="l01341"></a>01341 <span class="comment"></span>    <span class="keyword">template</span> &lt;<span class="keyword">class</span> InputIterator&gt;
<a name="l01342"></a><a class="code" href="a00001.html#ac7d4c03c5db5551f72d69f44471e3217">01342</a>     <span class="keyword">inline</span> <a class="code" href="a00001.html#ab8d4b1a025d08beb515f5e3a8033deb4" title="Default constructor initializing an empty B+ tree with the standard key comparison function...">btree</a>(InputIterator first, InputIterator last, <span class="keyword">const</span> <a class="code" href="a00001.html#a71413b8b8a1440539691a97f4cb61cae" title="Fourth template parameter: Key comparison function object.">key_compare</a> &amp;kcf,
<a name="l01343"></a>01343                  <span class="keyword">const</span> <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a> &amp;alloc = <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a>())
<a name="l01344"></a>01344         : <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>(NULL), <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>(NULL), <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>(NULL),
<a name="l01345"></a>01345           <a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>(kcf), <a class="code" href="a00001.html#a36368c13e6be2feca3cbcc0aa8950b64" title="Memory allocator.">m_allocator</a>(alloc)
<a name="l01346"></a>01346     {
<a name="l01347"></a>01347         <a class="code" href="a00001.html#a29d3aa8b03d2def35a358aebb2853053" title="Attempt to insert a key/data pair into the B+ tree.">insert</a>(first, last);
<a name="l01348"></a>01348     }
<a name="l01349"></a>01349 <span class="comment"></span>
<a name="l01350"></a>01350 <span class="comment">    /// Frees up all used B+ tree memory pages</span>
<a name="l01351"></a><a class="code" href="a00001.html#af3bb3b3b2596f973a258fefc46fe098f">01351</a> <span class="comment"></span>    <span class="keyword">inline</span> <a class="code" href="a00001.html#af3bb3b3b2596f973a258fefc46fe098f" title="Frees up all used B+ tree memory pages.">~btree</a>()
<a name="l01352"></a>01352     {
<a name="l01353"></a>01353         <a class="code" href="a00001.html#aa2acf975007740100b9803fcea573036" title="Frees all key/data pairs and all nodes of the tree.">clear</a>();
<a name="l01354"></a>01354     }
<a name="l01355"></a>01355 <span class="comment"></span>
<a name="l01356"></a>01356 <span class="comment">    /// Fast swapping of two identical B+ tree objects.</span>
<a name="l01357"></a><a class="code" href="a00001.html#a2413b9b084811d786cd928df4b9fe37c">01357</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#a2413b9b084811d786cd928df4b9fe37c" title="Fast swapping of two identical B+ tree objects.">swap</a>(<a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree_self</a>&amp; from)
<a name="l01358"></a>01358     {
<a name="l01359"></a>01359         <a class="code" href="a00001.html#a2413b9b084811d786cd928df4b9fe37c" title="Fast swapping of two identical B+ tree objects.">std::swap</a>(<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>, from.<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l01360"></a>01360         <a class="code" href="a00001.html#a2413b9b084811d786cd928df4b9fe37c" title="Fast swapping of two identical B+ tree objects.">std::swap</a>(<a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>, from.<a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>);
<a name="l01361"></a>01361         <a class="code" href="a00001.html#a2413b9b084811d786cd928df4b9fe37c" title="Fast swapping of two identical B+ tree objects.">std::swap</a>(<a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>, from.<a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>);
<a name="l01362"></a>01362         <a class="code" href="a00001.html#a2413b9b084811d786cd928df4b9fe37c" title="Fast swapping of two identical B+ tree objects.">std::swap</a>(<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>, from.<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>);
<a name="l01363"></a>01363         <a class="code" href="a00001.html#a2413b9b084811d786cd928df4b9fe37c" title="Fast swapping of two identical B+ tree objects.">std::swap</a>(<a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>, from.<a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>);
<a name="l01364"></a>01364         <a class="code" href="a00001.html#a2413b9b084811d786cd928df4b9fe37c" title="Fast swapping of two identical B+ tree objects.">std::swap</a>(<a class="code" href="a00001.html#a36368c13e6be2feca3cbcc0aa8950b64" title="Memory allocator.">m_allocator</a>, from.<a class="code" href="a00001.html#a36368c13e6be2feca3cbcc0aa8950b64" title="Memory allocator.">m_allocator</a>);
<a name="l01365"></a>01365     }
<a name="l01366"></a>01366 
<a name="l01367"></a>01367 <span class="keyword">public</span>:
<a name="l01368"></a>01368     <span class="comment">// *** Key and Value Comparison Function Objects</span>
<a name="l01369"></a>01369 <span class="comment"></span>
<a name="l01370"></a>01370 <span class="comment">    /// Function class to compare value_type objects. Required by the STL</span>
<a name="l01371"></a><a class="code" href="a00022.html">01371</a> <span class="comment"></span>    <span class="keyword">class </span><a class="code" href="a00022.html" title="Function class to compare value_type objects. Required by the STL.">value_compare</a>
<a name="l01372"></a>01372     {
<a name="l01373"></a>01373     <span class="keyword">protected</span>:<span class="comment"></span>
<a name="l01374"></a>01374 <span class="comment">        /// Key comparison function from the template parameter</span>
<a name="l01375"></a><a class="code" href="a00022.html#a7fa676ec0e6b36fde48f49358de96c74">01375</a> <span class="comment"></span>        <a class="code" href="a00001.html#a71413b8b8a1440539691a97f4cb61cae" title="Fourth template parameter: Key comparison function object.">key_compare</a>     <a class="code" href="a00022.html#a7fa676ec0e6b36fde48f49358de96c74" title="Key comparison function from the template parameter.">key_comp</a>;
<a name="l01376"></a>01376 <span class="comment"></span>
<a name="l01377"></a>01377 <span class="comment">        /// Constructor called from btree::value_comp()</span>
<a name="l01378"></a><a class="code" href="a00022.html#a64022a7383be900306573bea8c114c2e">01378</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00022.html#a64022a7383be900306573bea8c114c2e" title="Constructor called from btree::value_comp()">value_compare</a>(<a class="code" href="a00001.html#a71413b8b8a1440539691a97f4cb61cae" title="Fourth template parameter: Key comparison function object.">key_compare</a> kc)
<a name="l01379"></a>01379             : <a class="code" href="a00022.html#a7fa676ec0e6b36fde48f49358de96c74" title="Key comparison function from the template parameter.">key_comp</a>(kc)
<a name="l01380"></a>01380         { }
<a name="l01381"></a>01381 <span class="comment"></span>
<a name="l01382"></a>01382 <span class="comment">        /// Friendly to the btree class so it may call the constructor</span>
<a name="l01383"></a>01383 <span class="comment"></span>        <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree</a>&lt;<a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>, <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">data_type</a>, <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">value_type</a>, <a class="code" href="a00001.html#a71413b8b8a1440539691a97f4cb61cae" title="Fourth template parameter: Key comparison function object.">key_compare</a>,
<a name="l01384"></a><a class="code" href="a00022.html#a1de115e86b32c4ed13649b6760f1da28">01384</a>                            <a class="code" href="a00001.html#a8b13a0eb2e558d11830d38de21b82319" title="Fifth template parameter: Traits object used to define more parameters of the B+ tree.">traits</a>, <a class="code" href="a00001.html#acd41575a35d1c5d55e955aafc9762454" title="Sixth template parameter: Allow duplicate keys in the B+ tree.">allow_duplicates</a>, <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a>, <a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a>&gt;;
<a name="l01385"></a>01385 
<a name="l01386"></a>01386     <span class="keyword">public</span>:<span class="comment"></span>
<a name="l01387"></a>01387 <span class="comment">        /// Function call &quot;less&quot;-operator resulting in true if x &lt; y.</span>
<a name="l01388"></a><a class="code" href="a00022.html#a768a1b25f26381862906c76a4508775f">01388</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00022.html#a768a1b25f26381862906c76a4508775f" title="Function call &quot;less&quot;-operator resulting in true if x &lt; y.">operator()</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">value_type</a>&amp; x, <span class="keyword">const</span> <a class="code" href="a00001.html#ab66ffb9c9a42bea595ef23cf9dbfd8d6" title="Third template parameter: Composition pair of key and data types, this is required by the STL standar...">value_type</a>&amp; y)<span class="keyword"> const</span>
<a name="l01389"></a>01389 <span class="keyword">        </span>{
<a name="l01390"></a>01390             <span class="keywordflow">return</span> <a class="code" href="a00022.html#a7fa676ec0e6b36fde48f49358de96c74" title="Key comparison function from the template parameter.">key_comp</a>(x.first, y.first);
<a name="l01391"></a>01391         }
<a name="l01392"></a>01392     };
<a name="l01393"></a>01393 <span class="comment"></span>
<a name="l01394"></a>01394 <span class="comment">    /// Constant access to the key comparison object sorting the B+ tree</span>
<a name="l01395"></a><a class="code" href="a00001.html#a6200a8a00989f77f053e1200da7f816b">01395</a> <span class="comment"></span>    <span class="keyword">inline</span> <a class="code" href="a00001.html#a71413b8b8a1440539691a97f4cb61cae" title="Fourth template parameter: Key comparison function object.">key_compare</a> <a class="code" href="a00001.html#a6200a8a00989f77f053e1200da7f816b" title="Constant access to the key comparison object sorting the B+ tree.">key_comp</a>()<span class="keyword"> const</span>
<a name="l01396"></a>01396 <span class="keyword">    </span>{
<a name="l01397"></a>01397         <span class="keywordflow">return</span> <a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>;
<a name="l01398"></a>01398     }
<a name="l01399"></a>01399 <span class="comment"></span>
<a name="l01400"></a>01400 <span class="comment">    /// Constant access to a constructed value_type comparison object. Required</span>
<a name="l01401"></a>01401 <span class="comment">    /// by the STL</span>
<a name="l01402"></a><a class="code" href="a00001.html#a35152f783bc65c97504cd22d1812f673">01402</a> <span class="comment"></span>    <span class="keyword">inline</span> value_compare <a class="code" href="a00001.html#a35152f783bc65c97504cd22d1812f673" title="Constant access to a constructed value_type comparison object.">value_comp</a>()<span class="keyword"> const</span>
<a name="l01403"></a>01403 <span class="keyword">    </span>{
<a name="l01404"></a>01404         <span class="keywordflow">return</span> value_compare(<a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>);
<a name="l01405"></a>01405     }
<a name="l01406"></a>01406 
<a name="l01407"></a>01407 <span class="keyword">private</span>:
<a name="l01408"></a>01408     <span class="comment">// *** Convenient Key Comparison Functions Generated From key_less</span>
<a name="l01409"></a>01409 <span class="comment"></span>
<a name="l01410"></a>01410 <span class="comment">    /// True if a &lt; b ? &quot;constructed&quot; from m_key_less()</span>
<a name="l01411"></a><a class="code" href="a00001.html#a6ab60bc4547d2363c0a0d1b89e1e6c32">01411</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00001.html#a6ab60bc4547d2363c0a0d1b89e1e6c32" title="True if a &lt; b ? &quot;constructed&quot; from m_key_less()">key_less</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;a, <span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> b)<span class="keyword"> const</span>
<a name="l01412"></a>01412 <span class="keyword">    </span>{
<a name="l01413"></a>01413         <span class="keywordflow">return</span> <a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>(a, b);
<a name="l01414"></a>01414     }
<a name="l01415"></a>01415 <span class="comment"></span>
<a name="l01416"></a>01416 <span class="comment">    /// True if a &lt;= b ? constructed from key_less()</span>
<a name="l01417"></a><a class="code" href="a00001.html#a1a0b97590280a37b8622b000fe4d2d07">01417</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00001.html#a1a0b97590280a37b8622b000fe4d2d07" title="True if a &lt;= b ? constructed from key_less()">key_lessequal</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;a, <span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> b)<span class="keyword"> const</span>
<a name="l01418"></a>01418 <span class="keyword">    </span>{
<a name="l01419"></a>01419         <span class="keywordflow">return</span> !<a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>(b, a);
<a name="l01420"></a>01420     }
<a name="l01421"></a>01421 <span class="comment"></span>
<a name="l01422"></a>01422 <span class="comment">    /// True if a &gt; b ? constructed from key_less()</span>
<a name="l01423"></a><a class="code" href="a00001.html#a7846f950b879c014e9379860266ef0b5">01423</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00001.html#a7846f950b879c014e9379860266ef0b5" title="True if a &gt; b ? constructed from key_less()">key_greater</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;a, <span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;b)<span class="keyword"> const</span>
<a name="l01424"></a>01424 <span class="keyword">    </span>{
<a name="l01425"></a>01425         <span class="keywordflow">return</span> <a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>(b, a);
<a name="l01426"></a>01426     }
<a name="l01427"></a>01427 <span class="comment"></span>
<a name="l01428"></a>01428 <span class="comment">    /// True if a &gt;= b ? constructed from key_less()</span>
<a name="l01429"></a><a class="code" href="a00001.html#a7d9e621a7b8c3e88820e49874381ec1b">01429</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00001.html#a7d9e621a7b8c3e88820e49874381ec1b" title="True if a &gt;= b ? constructed from key_less()">key_greaterequal</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;a, <span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> b)<span class="keyword"> const</span>
<a name="l01430"></a>01430 <span class="keyword">    </span>{
<a name="l01431"></a>01431         <span class="keywordflow">return</span> !<a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>(a, b);
<a name="l01432"></a>01432     }
<a name="l01433"></a>01433 <span class="comment"></span>
<a name="l01434"></a>01434 <span class="comment">    /// True if a == b ? constructed from key_less(). This requires the &lt;</span>
<a name="l01435"></a>01435 <span class="comment">    /// relation to be a total order, otherwise the B+ tree cannot be sorted.</span>
<a name="l01436"></a><a class="code" href="a00001.html#ac3b0c8e750101dfad0ef70c54532dd68">01436</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00001.html#ac3b0c8e750101dfad0ef70c54532dd68" title="True if a == b ? constructed from key_less().">key_equal</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;a, <span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;b)<span class="keyword"> const</span>
<a name="l01437"></a>01437 <span class="keyword">    </span>{
<a name="l01438"></a>01438         <span class="keywordflow">return</span> !<a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>(a, b) &amp;&amp; !<a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>(b, a);
<a name="l01439"></a>01439     }
<a name="l01440"></a>01440 
<a name="l01441"></a>01441 <span class="keyword">public</span>:
<a name="l01442"></a>01442     <span class="comment">// *** Allocators</span>
<a name="l01443"></a>01443 <span class="comment"></span>
<a name="l01444"></a>01444 <span class="comment">    /// Return the base node allocator provided during construction.</span>
<a name="l01445"></a><a class="code" href="a00001.html#ad7b097e1a4301e319d8a7e6f6bb661fd">01445</a> <span class="comment"></span>    <a class="code" href="a00001.html#aef567d7893cd02d22933a2e68702532b" title="Seventh template parameter: STL allocator for tree nodes.">allocator_type</a> <a class="code" href="a00001.html#ad7b097e1a4301e319d8a7e6f6bb661fd" title="Return the base node allocator provided during construction.">get_allocator</a>()<span class="keyword"> const</span>
<a name="l01446"></a>01446 <span class="keyword">    </span>{
<a name="l01447"></a>01447         <span class="keywordflow">return</span> <a class="code" href="a00001.html#a36368c13e6be2feca3cbcc0aa8950b64" title="Memory allocator.">m_allocator</a>;
<a name="l01448"></a>01448     }
<a name="l01449"></a>01449 
<a name="l01450"></a>01450 <span class="keyword">private</span>:
<a name="l01451"></a>01451     <span class="comment">// *** Node Object Allocation and Deallocation Functions</span>
<a name="l01452"></a>01452 <span class="comment"></span>
<a name="l01453"></a>01453 <span class="comment">    /// Return an allocator for leaf_node objects</span>
<a name="l01454"></a><a class="code" href="a00001.html#aacca4955cae12c5da0b91a020d05d42a">01454</a> <span class="comment"></span>    <span class="keyword">typename</span> <a class="code" href="a00017.html#a99d5a3d40c5098a75bbcb9404971e4fd" title="Define an related allocator for the leaf_node structs.">leaf_node::alloc_type</a> <a class="code" href="a00001.html#aacca4955cae12c5da0b91a020d05d42a" title="Return an allocator for leaf_node objects.">leaf_node_allocator</a>()
<a name="l01455"></a>01455     {
<a name="l01456"></a>01456         <span class="keywordflow">return</span> <span class="keyword">typename</span> <a class="code" href="a00017.html#a99d5a3d40c5098a75bbcb9404971e4fd" title="Define an related allocator for the leaf_node structs.">leaf_node::alloc_type</a>(<a class="code" href="a00001.html#a36368c13e6be2feca3cbcc0aa8950b64" title="Memory allocator.">m_allocator</a>);
<a name="l01457"></a>01457     }
<a name="l01458"></a>01458 <span class="comment"></span>
<a name="l01459"></a>01459 <span class="comment">    /// Return an allocator for inner_node objects</span>
<a name="l01460"></a><a class="code" href="a00001.html#a583e6f3a9b61bb4b0ca9886ea52f73b9">01460</a> <span class="comment"></span>    <span class="keyword">typename</span> <a class="code" href="a00015.html#a0d8b919b9db1069387e966ae4b39c1b5" title="Define an related allocator for the inner_node structs.">inner_node::alloc_type</a> <a class="code" href="a00001.html#a583e6f3a9b61bb4b0ca9886ea52f73b9" title="Return an allocator for inner_node objects.">inner_node_allocator</a>()
<a name="l01461"></a>01461     {
<a name="l01462"></a>01462         <span class="keywordflow">return</span> <span class="keyword">typename</span> <a class="code" href="a00015.html#a0d8b919b9db1069387e966ae4b39c1b5" title="Define an related allocator for the inner_node structs.">inner_node::alloc_type</a>(<a class="code" href="a00001.html#a36368c13e6be2feca3cbcc0aa8950b64" title="Memory allocator.">m_allocator</a>);
<a name="l01463"></a>01463     }
<a name="l01464"></a>01464 <span class="comment"></span>
<a name="l01465"></a>01465 <span class="comment">    /// Allocate and initialize a leaf node</span>
<a name="l01466"></a><a class="code" href="a00001.html#ab6ff4b0f13f48e417a45431318a00337">01466</a> <span class="comment"></span>    <span class="keyword">inline</span> leaf_node* <a class="code" href="a00001.html#ab6ff4b0f13f48e417a45431318a00337" title="Allocate and initialize a leaf node.">allocate_leaf</a>()
<a name="l01467"></a>01467     {
<a name="l01468"></a>01468         leaf_node *n = <span class="keyword">new</span> (<a class="code" href="a00001.html#aacca4955cae12c5da0b91a020d05d42a" title="Return an allocator for leaf_node objects.">leaf_node_allocator</a>().allocate(1)) leaf_node();
<a name="l01469"></a>01469         n-&gt;<a class="code" href="a00017.html#a3db9141d0f1335ebaacb141ab6eef0d1" title="Set variables to initial values.">initialize</a>();
<a name="l01470"></a>01470         <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#aa4d4f72b9a8f7a58424063aa1d4a1fcc" title="Number of leaves in the B+ tree.">leaves</a>++;
<a name="l01471"></a>01471         <span class="keywordflow">return</span> n;
<a name="l01472"></a>01472     }
<a name="l01473"></a>01473 <span class="comment"></span>
<a name="l01474"></a>01474 <span class="comment">    /// Allocate and initialize an inner node</span>
<a name="l01475"></a><a class="code" href="a00001.html#a1bf04093f2dc2a1cb57955ff55d3762a">01475</a> <span class="comment"></span>    <span class="keyword">inline</span> inner_node* <a class="code" href="a00001.html#a1bf04093f2dc2a1cb57955ff55d3762a" title="Allocate and initialize an inner node.">allocate_inner</a>(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> level)
<a name="l01476"></a>01476     {
<a name="l01477"></a>01477         inner_node *n = <span class="keyword">new</span> (<a class="code" href="a00001.html#a583e6f3a9b61bb4b0ca9886ea52f73b9" title="Return an allocator for inner_node objects.">inner_node_allocator</a>().allocate(1)) inner_node();
<a name="l01478"></a>01478         n-&gt;<a class="code" href="a00015.html#ae10027d02927a1c8c2303a419197078c" title="Set variables to initial values.">initialize</a>(level);
<a name="l01479"></a>01479         <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#ab63b03a814b985680a46151fd9f59e17" title="Number of inner nodes in the B+ tree.">innernodes</a>++;
<a name="l01480"></a>01480         <span class="keywordflow">return</span> n;
<a name="l01481"></a>01481     }
<a name="l01482"></a>01482 <span class="comment"></span>
<a name="l01483"></a>01483 <span class="comment">    /// Correctly free either inner or leaf node, destructs all contained key</span>
<a name="l01484"></a>01484 <span class="comment">    /// and value objects</span>
<a name="l01485"></a><a class="code" href="a00001.html#a1bac362a2e8585e6682d332c9b4ec583">01485</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="a00001.html#a1bac362a2e8585e6682d332c9b4ec583" title="Correctly free either inner or leaf node, destructs all contained key and value objects.">free_node</a>(node *n)
<a name="l01486"></a>01486     {
<a name="l01487"></a>01487         <span class="keywordflow">if</span> (n-&gt;isleafnode()) {
<a name="l01488"></a>01488             leaf_node *ln = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l01489"></a>01489             <span class="keyword">typename</span> <a class="code" href="a00017.html#a99d5a3d40c5098a75bbcb9404971e4fd" title="Define an related allocator for the leaf_node structs.">leaf_node::alloc_type</a> a(<a class="code" href="a00001.html#aacca4955cae12c5da0b91a020d05d42a" title="Return an allocator for leaf_node objects.">leaf_node_allocator</a>());
<a name="l01490"></a>01490             a.destroy(ln);
<a name="l01491"></a>01491             a.deallocate(ln, 1);
<a name="l01492"></a>01492             <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#aa4d4f72b9a8f7a58424063aa1d4a1fcc" title="Number of leaves in the B+ tree.">leaves</a>--;
<a name="l01493"></a>01493         }
<a name="l01494"></a>01494         <span class="keywordflow">else</span> {
<a name="l01495"></a>01495             inner_node *in = <span class="keyword">static_cast&lt;</span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l01496"></a>01496             <span class="keyword">typename</span> <a class="code" href="a00015.html#a0d8b919b9db1069387e966ae4b39c1b5" title="Define an related allocator for the inner_node structs.">inner_node::alloc_type</a> a(<a class="code" href="a00001.html#a583e6f3a9b61bb4b0ca9886ea52f73b9" title="Return an allocator for inner_node objects.">inner_node_allocator</a>());
<a name="l01497"></a>01497             a.destroy(in);
<a name="l01498"></a>01498             a.deallocate(in, 1);
<a name="l01499"></a>01499             <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#ab63b03a814b985680a46151fd9f59e17" title="Number of inner nodes in the B+ tree.">innernodes</a>--;
<a name="l01500"></a>01500         }
<a name="l01501"></a>01501     }
<a name="l01502"></a>01502 <span class="comment"></span>
<a name="l01503"></a>01503 <span class="comment">    /// Convenient template function for conditional copying of slotdata. This</span>
<a name="l01504"></a>01504 <span class="comment">    /// should be used instead of std::copy for all slotdata manipulations.</span>
<a name="l01505"></a>01505 <span class="comment"></span>    <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIterator, <span class="keyword">class</span> OutputIterator&gt;
<a name="l01506"></a><a class="code" href="a00001.html#ad8a89e088fbfedec4218ea46f8899941">01506</a>     <span class="keyword">static</span> OutputIterator <a class="code" href="a00001.html#ad8a89e088fbfedec4218ea46f8899941" title="Convenient template function for conditional copying of slotdata.">data_copy</a> (InputIterator first, InputIterator last,
<a name="l01507"></a>01507                                      OutputIterator result)
<a name="l01508"></a>01508     {
<a name="l01509"></a>01509         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a>) <span class="keywordflow">return</span> result; <span class="comment">// no operation</span>
<a name="l01510"></a>01510         <span class="keywordflow">else</span> <span class="keywordflow">return</span> std::copy(first, last, result);
<a name="l01511"></a>01511     }
<a name="l01512"></a>01512 <span class="comment"></span>
<a name="l01513"></a>01513 <span class="comment">    /// Convenient template function for conditional copying of slotdata. This</span>
<a name="l01514"></a>01514 <span class="comment">    /// should be used instead of std::copy for all slotdata manipulations.</span>
<a name="l01515"></a>01515 <span class="comment"></span>    <span class="keyword">template</span>&lt;<span class="keyword">class</span> InputIterator, <span class="keyword">class</span> OutputIterator&gt;
<a name="l01516"></a><a class="code" href="a00001.html#a555a24bfd925a5d77bba28041d207f8d">01516</a>     <span class="keyword">static</span> OutputIterator <a class="code" href="a00001.html#a555a24bfd925a5d77bba28041d207f8d" title="Convenient template function for conditional copying of slotdata.">data_copy_backward</a> (InputIterator first, InputIterator last,
<a name="l01517"></a>01517                                               OutputIterator result)
<a name="l01518"></a>01518     {
<a name="l01519"></a>01519         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a>) <span class="keywordflow">return</span> result; <span class="comment">// no operation</span>
<a name="l01520"></a>01520         <span class="keywordflow">else</span> <span class="keywordflow">return</span> std::copy_backward(first, last, result);
<a name="l01521"></a>01521     }
<a name="l01522"></a>01522 
<a name="l01523"></a>01523 <span class="keyword">public</span>:
<a name="l01524"></a>01524     <span class="comment">// *** Fast Destruction of the B+ Tree</span>
<a name="l01525"></a>01525 <span class="comment"></span>
<a name="l01526"></a>01526 <span class="comment">    /// Frees all key/data pairs and all nodes of the tree</span>
<a name="l01527"></a><a class="code" href="a00001.html#aa2acf975007740100b9803fcea573036">01527</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#aa2acf975007740100b9803fcea573036" title="Frees all key/data pairs and all nodes of the tree.">clear</a>()
<a name="l01528"></a>01528     {
<a name="l01529"></a>01529         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>)
<a name="l01530"></a>01530         {
<a name="l01531"></a>01531             <a class="code" href="a00001.html#a33241f6ae21f58c9747a6392470b646c" title="Recursively free up nodes.">clear_recursive</a>(<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l01532"></a>01532             <a class="code" href="a00001.html#a1bac362a2e8585e6682d332c9b4ec583" title="Correctly free either inner or leaf node, destructs all contained key and value objects.">free_node</a>(<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l01533"></a>01533 
<a name="l01534"></a>01534             <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> = NULL;
<a name="l01535"></a>01535             <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a> = <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> = NULL;
<a name="l01536"></a>01536 
<a name="l01537"></a>01537             <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a> = tree_stats();
<a name="l01538"></a>01538         }
<a name="l01539"></a>01539 
<a name="l01540"></a>01540         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a> == 0);
<a name="l01541"></a>01541     }
<a name="l01542"></a>01542 
<a name="l01543"></a>01543 <span class="keyword">private</span>:<span class="comment"></span>
<a name="l01544"></a>01544 <span class="comment">    /// Recursively free up nodes</span>
<a name="l01545"></a><a class="code" href="a00001.html#a33241f6ae21f58c9747a6392470b646c">01545</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#a33241f6ae21f58c9747a6392470b646c" title="Recursively free up nodes.">clear_recursive</a>(node *n)
<a name="l01546"></a>01546     {
<a name="l01547"></a>01547         <span class="keywordflow">if</span> (n-&gt;isleafnode())
<a name="l01548"></a>01548         {
<a name="l01549"></a>01549             leaf_node *leafnode = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l01550"></a>01550 
<a name="l01551"></a>01551             <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> slot = 0; slot &lt; leafnode-&gt;slotuse; ++slot)
<a name="l01552"></a>01552             {
<a name="l01553"></a>01553                 <span class="comment">// data objects are deleted by leaf_node&#39;s destructor</span>
<a name="l01554"></a>01554             }
<a name="l01555"></a>01555         }
<a name="l01556"></a>01556         <span class="keywordflow">else</span>
<a name="l01557"></a>01557         {
<a name="l01558"></a>01558             inner_node *innernode = <span class="keyword">static_cast&lt;</span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l01559"></a>01559 
<a name="l01560"></a>01560             <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> slot = 0; slot &lt; innernode-&gt;slotuse + 1; ++slot)
<a name="l01561"></a>01561             {
<a name="l01562"></a>01562                 <a class="code" href="a00001.html#a33241f6ae21f58c9747a6392470b646c" title="Recursively free up nodes.">clear_recursive</a>(innernode-&gt;childid[slot]);
<a name="l01563"></a>01563                 <a class="code" href="a00001.html#a1bac362a2e8585e6682d332c9b4ec583" title="Correctly free either inner or leaf node, destructs all contained key and value objects.">free_node</a>(innernode-&gt;childid[slot]);
<a name="l01564"></a>01564             }
<a name="l01565"></a>01565         }
<a name="l01566"></a>01566     }
<a name="l01567"></a>01567 
<a name="l01568"></a>01568 <span class="keyword">public</span>:
<a name="l01569"></a>01569     <span class="comment">// *** STL Iterator Construction Functions</span>
<a name="l01570"></a>01570 <span class="comment"></span>
<a name="l01571"></a>01571 <span class="comment">    /// Constructs a read/data-write iterator that points to the first slot in</span>
<a name="l01572"></a>01572 <span class="comment">    /// the first leaf of the B+ tree.</span>
<a name="l01573"></a><a class="code" href="a00001.html#a564a6ea78bcc0de0bbc1fdff65f547fd">01573</a> <span class="comment"></span>    <span class="keyword">inline</span> iterator <a class="code" href="a00001.html#a564a6ea78bcc0de0bbc1fdff65f547fd" title="Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree...">begin</a>()
<a name="l01574"></a>01574     {
<a name="l01575"></a>01575         <span class="keywordflow">return</span> iterator(<a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>, 0);
<a name="l01576"></a>01576     }
<a name="l01577"></a>01577 <span class="comment"></span>
<a name="l01578"></a>01578 <span class="comment">    /// Constructs a read/data-write iterator that points to the first invalid</span>
<a name="l01579"></a>01579 <span class="comment">    /// slot in the last leaf of the B+ tree.</span>
<a name="l01580"></a><a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d">01580</a> <span class="comment"></span>    <span class="keyword">inline</span> iterator <a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>()
<a name="l01581"></a>01581     {
<a name="l01582"></a>01582         <span class="keywordflow">return</span> iterator(<a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>, <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> ? <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> : 0);
<a name="l01583"></a>01583     }
<a name="l01584"></a>01584 <span class="comment"></span>
<a name="l01585"></a>01585 <span class="comment">    /// Constructs a read-only constant iterator that points to the first slot</span>
<a name="l01586"></a>01586 <span class="comment">    /// in the first leaf of the B+ tree.</span>
<a name="l01587"></a><a class="code" href="a00001.html#a530d199e20aaf216b82f43a51e1c4526">01587</a> <span class="comment"></span>    <span class="keyword">inline</span> const_iterator <a class="code" href="a00001.html#a564a6ea78bcc0de0bbc1fdff65f547fd" title="Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree...">begin</a>()<span class="keyword"> const</span>
<a name="l01588"></a>01588 <span class="keyword">    </span>{
<a name="l01589"></a>01589         <span class="keywordflow">return</span> const_iterator(<a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>, 0);
<a name="l01590"></a>01590     }
<a name="l01591"></a>01591 <span class="comment"></span>
<a name="l01592"></a>01592 <span class="comment">    /// Constructs a read-only constant iterator that points to the first</span>
<a name="l01593"></a>01593 <span class="comment">    /// invalid slot in the last leaf of the B+ tree.</span>
<a name="l01594"></a><a class="code" href="a00001.html#aaad45bd0825139ad9168fc4ee143fe7d">01594</a> <span class="comment"></span>    <span class="keyword">inline</span> const_iterator <a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>()<span class="keyword"> const</span>
<a name="l01595"></a>01595 <span class="keyword">    </span>{
<a name="l01596"></a>01596         <span class="keywordflow">return</span> const_iterator(<a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>, <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> ? <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> : 0);
<a name="l01597"></a>01597     }
<a name="l01598"></a>01598 <span class="comment"></span>
<a name="l01599"></a>01599 <span class="comment">    /// Constructs a read/data-write reverse iterator that points to the first</span>
<a name="l01600"></a>01600 <span class="comment">    /// invalid slot in the last leaf of the B+ tree. Uses STL magic.</span>
<a name="l01601"></a><a class="code" href="a00001.html#a4e2f4ba4141820f4bc5782298c261aa5">01601</a> <span class="comment"></span>    <span class="keyword">inline</span> reverse_iterator <a class="code" href="a00001.html#a4e2f4ba4141820f4bc5782298c261aa5" title="Constructs a read/data-write reverse iterator that points to the first invalid slot in the last leaf ...">rbegin</a>()
<a name="l01602"></a>01602     {
<a name="l01603"></a>01603         <span class="keywordflow">return</span> reverse_iterator(<a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>());
<a name="l01604"></a>01604     }
<a name="l01605"></a>01605 <span class="comment"></span>
<a name="l01606"></a>01606 <span class="comment">    /// Constructs a read/data-write reverse iterator that points to the first</span>
<a name="l01607"></a>01607 <span class="comment">    /// slot in the first leaf of the B+ tree. Uses STL magic.</span>
<a name="l01608"></a><a class="code" href="a00001.html#a625d6f5e37cfed631a403fe36fa818dc">01608</a> <span class="comment"></span>    <span class="keyword">inline</span> reverse_iterator <a class="code" href="a00001.html#a625d6f5e37cfed631a403fe36fa818dc" title="Constructs a read/data-write reverse iterator that points to the first slot in the first leaf of the ...">rend</a>()
<a name="l01609"></a>01609     {
<a name="l01610"></a>01610         <span class="keywordflow">return</span> reverse_iterator(<a class="code" href="a00001.html#a564a6ea78bcc0de0bbc1fdff65f547fd" title="Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree...">begin</a>());
<a name="l01611"></a>01611     }
<a name="l01612"></a>01612 <span class="comment"></span>
<a name="l01613"></a>01613 <span class="comment">    /// Constructs a read-only reverse iterator that points to the first</span>
<a name="l01614"></a>01614 <span class="comment">    /// invalid slot in the last leaf of the B+ tree. Uses STL magic.</span>
<a name="l01615"></a><a class="code" href="a00001.html#a6a6224c68ffa219bf9ca4f4ef229e915">01615</a> <span class="comment"></span>    <span class="keyword">inline</span> const_reverse_iterator <a class="code" href="a00001.html#a4e2f4ba4141820f4bc5782298c261aa5" title="Constructs a read/data-write reverse iterator that points to the first invalid slot in the last leaf ...">rbegin</a>()<span class="keyword"> const</span>
<a name="l01616"></a>01616 <span class="keyword">    </span>{
<a name="l01617"></a>01617         <span class="keywordflow">return</span> const_reverse_iterator(<a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>());
<a name="l01618"></a>01618     }
<a name="l01619"></a>01619 <span class="comment"></span>
<a name="l01620"></a>01620 <span class="comment">    /// Constructs a read-only reverse iterator that points to the first slot</span>
<a name="l01621"></a>01621 <span class="comment">    /// in the first leaf of the B+ tree. Uses STL magic.</span>
<a name="l01622"></a><a class="code" href="a00001.html#aa0536538d736bf52c94144b806bfd12f">01622</a> <span class="comment"></span>    <span class="keyword">inline</span> const_reverse_iterator <a class="code" href="a00001.html#a625d6f5e37cfed631a403fe36fa818dc" title="Constructs a read/data-write reverse iterator that points to the first slot in the first leaf of the ...">rend</a>()<span class="keyword"> const</span>
<a name="l01623"></a>01623 <span class="keyword">    </span>{
<a name="l01624"></a>01624         <span class="keywordflow">return</span> const_reverse_iterator(<a class="code" href="a00001.html#a564a6ea78bcc0de0bbc1fdff65f547fd" title="Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree...">begin</a>());
<a name="l01625"></a>01625     }
<a name="l01626"></a>01626 
<a name="l01627"></a>01627 <span class="keyword">private</span>:
<a name="l01628"></a>01628     <span class="comment">// *** B+ Tree Node Binary Search Functions</span>
<a name="l01629"></a>01629 <span class="comment"></span>
<a name="l01630"></a>01630 <span class="comment">    /// Searches for the first key in the node n greater or equal to key. Uses</span>
<a name="l01631"></a>01631 <span class="comment">    /// binary search with an optional linear self-verification. This is a</span>
<a name="l01632"></a>01632 <span class="comment">    /// template function, because the slotkey array is located at different</span>
<a name="l01633"></a>01633 <span class="comment">    /// places in leaf_node and inner_node.</span>
<a name="l01634"></a>01634 <span class="comment"></span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> node_type&gt;
<a name="l01635"></a><a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669">01635</a>     <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(<span class="keyword">const</span> node_type *n, <span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key)<span class="keyword"> const</span>
<a name="l01636"></a>01636 <span class="keyword">    </span>{
<a name="l01637"></a>01637         <span class="keywordflow">if</span> ( 0 &amp;&amp; <span class="keyword">sizeof</span>(n-&gt;slotkey) &gt; traits::binsearch_threshold )
<a name="l01638"></a>01638         {
<a name="l01639"></a>01639             <span class="keywordflow">if</span> (n-&gt;slotuse == 0) <span class="keywordflow">return</span> 0;
<a name="l01640"></a>01640 
<a name="l01641"></a>01641             <span class="keywordtype">int</span> lo = 0, hi = n-&gt;slotuse;
<a name="l01642"></a>01642 
<a name="l01643"></a>01643             <span class="keywordflow">while</span> (lo &lt; hi)
<a name="l01644"></a>01644             {
<a name="l01645"></a>01645                 <span class="keywordtype">int</span> mid = (lo + hi) &gt;&gt; 1;
<a name="l01646"></a>01646 
<a name="l01647"></a>01647                 <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a1a0b97590280a37b8622b000fe4d2d07" title="True if a &lt;= b ? constructed from key_less()">key_lessequal</a>(key, n-&gt;slotkey[mid])) {
<a name="l01648"></a>01648                     hi = mid; <span class="comment">// key &lt;= mid</span>
<a name="l01649"></a>01649                 }
<a name="l01650"></a>01650                 <span class="keywordflow">else</span> {
<a name="l01651"></a>01651                     lo = mid + 1; <span class="comment">// key &gt; mid</span>
<a name="l01652"></a>01652                 }
<a name="l01653"></a>01653             }
<a name="l01654"></a>01654 
<a name="l01655"></a>01655             <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::find_lower: on &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; key &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; -&gt; &quot;</span> &lt;&lt; lo &lt;&lt; <span class="stringliteral">&quot; / &quot;</span> &lt;&lt; hi);
<a name="l01656"></a>01656 
<a name="l01657"></a>01657             <span class="comment">// verify result using simple linear search</span>
<a name="l01658"></a>01658             <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>)
<a name="l01659"></a>01659             {
<a name="l01660"></a>01660                 <span class="keywordtype">int</span> i = 0;
<a name="l01661"></a>01661                 <span class="keywordflow">while</span> (i &lt; n-&gt;slotuse &amp;&amp; <a class="code" href="a00001.html#a6ab60bc4547d2363c0a0d1b89e1e6c32" title="True if a &lt; b ? &quot;constructed&quot; from m_key_less()">key_less</a>(n-&gt;slotkey[i],key)) ++i;
<a name="l01662"></a>01662 
<a name="l01663"></a>01663                 <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::find_lower: testfind: &quot;</span> &lt;&lt; i);
<a name="l01664"></a>01664                 <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(i == lo);
<a name="l01665"></a>01665             }
<a name="l01666"></a>01666 
<a name="l01667"></a>01667             <span class="keywordflow">return</span> lo;
<a name="l01668"></a>01668         }
<a name="l01669"></a>01669         <span class="keywordflow">else</span> <span class="comment">// for nodes &lt;= binsearch_threshold do linear search.</span>
<a name="l01670"></a>01670         {
<a name="l01671"></a>01671             <span class="keywordtype">int</span> lo = 0;
<a name="l01672"></a>01672             <span class="keywordflow">while</span> (lo &lt; n-&gt;slotuse &amp;&amp; <a class="code" href="a00001.html#a6ab60bc4547d2363c0a0d1b89e1e6c32" title="True if a &lt; b ? &quot;constructed&quot; from m_key_less()">key_less</a>(n-&gt;slotkey[lo],key)) ++lo;
<a name="l01673"></a>01673             <span class="keywordflow">return</span> lo;
<a name="l01674"></a>01674         }
<a name="l01675"></a>01675     }
<a name="l01676"></a>01676 <span class="comment"></span>
<a name="l01677"></a>01677 <span class="comment">    /// Searches for the first key in the node n greater than key. Uses binary</span>
<a name="l01678"></a>01678 <span class="comment">    /// search with an optional linear self-verification. This is a template</span>
<a name="l01679"></a>01679 <span class="comment">    /// function, because the slotkey array is located at different places in</span>
<a name="l01680"></a>01680 <span class="comment">    /// leaf_node and inner_node.</span>
<a name="l01681"></a>01681 <span class="comment"></span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> node_type&gt;
<a name="l01682"></a><a class="code" href="a00001.html#a46ff197e60365a8cad59fd72f935b59c">01682</a>     <span class="keyword">inline</span> <span class="keywordtype">int</span> <a class="code" href="a00001.html#a46ff197e60365a8cad59fd72f935b59c" title="Searches for the first key in the node n greater than key.">find_upper</a>(<span class="keyword">const</span> node_type *n, <span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key)<span class="keyword"> const</span>
<a name="l01683"></a>01683 <span class="keyword">    </span>{
<a name="l01684"></a>01684         <span class="keywordflow">if</span> ( 0 &amp;&amp; <span class="keyword">sizeof</span>(n-&gt;slotkey) &gt; traits::binsearch_threshold )
<a name="l01685"></a>01685         {
<a name="l01686"></a>01686             <span class="keywordflow">if</span> (n-&gt;slotuse == 0) <span class="keywordflow">return</span> 0;
<a name="l01687"></a>01687 
<a name="l01688"></a>01688             <span class="keywordtype">int</span> lo = 0, hi = n-&gt;slotuse;
<a name="l01689"></a>01689 
<a name="l01690"></a>01690             <span class="keywordflow">while</span> (lo &lt; hi)
<a name="l01691"></a>01691             {
<a name="l01692"></a>01692                 <span class="keywordtype">int</span> mid = (lo + hi) &gt;&gt; 1;
<a name="l01693"></a>01693 
<a name="l01694"></a>01694                 <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a6ab60bc4547d2363c0a0d1b89e1e6c32" title="True if a &lt; b ? &quot;constructed&quot; from m_key_less()">key_less</a>(key, n-&gt;slotkey[mid])) {
<a name="l01695"></a>01695                     hi = mid; <span class="comment">// key &lt; mid</span>
<a name="l01696"></a>01696                 }
<a name="l01697"></a>01697                 <span class="keywordflow">else</span> {
<a name="l01698"></a>01698                     lo = mid + 1; <span class="comment">// key &gt;= mid</span>
<a name="l01699"></a>01699                 }
<a name="l01700"></a>01700             }
<a name="l01701"></a>01701 
<a name="l01702"></a>01702             <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::find_upper: on &quot;</span> &lt;&lt; n &lt;&lt; <span class="stringliteral">&quot; key &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; -&gt; &quot;</span> &lt;&lt; lo &lt;&lt; <span class="stringliteral">&quot; / &quot;</span> &lt;&lt; hi);
<a name="l01703"></a>01703 
<a name="l01704"></a>01704             <span class="comment">// verify result using simple linear search</span>
<a name="l01705"></a>01705             <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>)
<a name="l01706"></a>01706             {
<a name="l01707"></a>01707                 <span class="keywordtype">int</span> i = 0;
<a name="l01708"></a>01708                 <span class="keywordflow">while</span> (i &lt; n-&gt;slotuse &amp;&amp; <a class="code" href="a00001.html#a1a0b97590280a37b8622b000fe4d2d07" title="True if a &lt;= b ? constructed from key_less()">key_lessequal</a>(n-&gt;slotkey[i],key)) ++i;
<a name="l01709"></a>01709 
<a name="l01710"></a>01710                 <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::find_upper testfind: &quot;</span> &lt;&lt; i);
<a name="l01711"></a>01711                 <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(i == hi);
<a name="l01712"></a>01712             }
<a name="l01713"></a>01713 
<a name="l01714"></a>01714             <span class="keywordflow">return</span> lo;
<a name="l01715"></a>01715         }
<a name="l01716"></a>01716         <span class="keywordflow">else</span> <span class="comment">// for nodes &lt;= binsearch_threshold do linear search.</span>
<a name="l01717"></a>01717         {
<a name="l01718"></a>01718             <span class="keywordtype">int</span> lo = 0;
<a name="l01719"></a>01719             <span class="keywordflow">while</span> (lo &lt; n-&gt;slotuse &amp;&amp; <a class="code" href="a00001.html#a1a0b97590280a37b8622b000fe4d2d07" title="True if a &lt;= b ? constructed from key_less()">key_lessequal</a>(n-&gt;slotkey[lo],key)) ++lo;
<a name="l01720"></a>01720             <span class="keywordflow">return</span> lo;
<a name="l01721"></a>01721         }
<a name="l01722"></a>01722     }
<a name="l01723"></a>01723 
<a name="l01724"></a>01724 <span class="keyword">public</span>:
<a name="l01725"></a>01725     <span class="comment">// *** Access Functions to the Item Count</span>
<a name="l01726"></a>01726 <span class="comment"></span>
<a name="l01727"></a>01727 <span class="comment">    /// Return the number of key/data pairs in the B+ tree</span>
<a name="l01728"></a><a class="code" href="a00001.html#a3942d7144bc93cf094b62f03e6113f4e">01728</a> <span class="comment"></span>    <span class="keyword">inline</span> <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a> <a class="code" href="a00001.html#a3942d7144bc93cf094b62f03e6113f4e" title="Return the number of key/data pairs in the B+ tree.">size</a>()<span class="keyword"> const</span>
<a name="l01729"></a>01729 <span class="keyword">    </span>{
<a name="l01730"></a>01730         <span class="keywordflow">return</span> <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a>;
<a name="l01731"></a>01731     }
<a name="l01732"></a>01732 <span class="comment"></span>
<a name="l01733"></a>01733 <span class="comment">    /// Returns true if there is at least one key/data pair in the B+ tree</span>
<a name="l01734"></a><a class="code" href="a00001.html#ad7cf0c4833d2ea3fcd79df4c884bab40">01734</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00001.html#ad7cf0c4833d2ea3fcd79df4c884bab40" title="Returns true if there is at least one key/data pair in the B+ tree.">empty</a>()<span class="keyword"> const</span>
<a name="l01735"></a>01735 <span class="keyword">    </span>{
<a name="l01736"></a>01736         <span class="keywordflow">return</span> (<a class="code" href="a00001.html#a3942d7144bc93cf094b62f03e6113f4e" title="Return the number of key/data pairs in the B+ tree.">size</a>() == <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a>(0));
<a name="l01737"></a>01737     }
<a name="l01738"></a>01738 <span class="comment"></span>
<a name="l01739"></a>01739 <span class="comment">    /// Returns the largest possible size of the B+ Tree. This is just a</span>
<a name="l01740"></a>01740 <span class="comment">    /// function required by the STL standard, the B+ Tree can hold more items.</span>
<a name="l01741"></a><a class="code" href="a00001.html#a3285e41cd6c4566e99d8c82803ad4d92">01741</a> <span class="comment"></span>    <span class="keyword">inline</span> <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a> <a class="code" href="a00001.html#a3285e41cd6c4566e99d8c82803ad4d92" title="Returns the largest possible size of the B+ Tree.">max_size</a>()<span class="keyword"> const</span>
<a name="l01742"></a>01742 <span class="keyword">    </span>{
<a name="l01743"></a>01743         <span class="keywordflow">return</span> <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a>(-1);
<a name="l01744"></a>01744     }
<a name="l01745"></a>01745 <span class="comment"></span>
<a name="l01746"></a>01746 <span class="comment">    /// Return a const reference to the current statistics.</span>
<a name="l01747"></a><a class="code" href="a00001.html#a81c7f4e56b3421976855daf40c6e20fc">01747</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keyword">const</span> <span class="keyword">struct </span>tree_stats&amp; <a class="code" href="a00001.html#a81c7f4e56b3421976855daf40c6e20fc" title="Return a const reference to the current statistics.">get_stats</a>()<span class="keyword"> const</span>
<a name="l01748"></a>01748 <span class="keyword">    </span>{
<a name="l01749"></a>01749         <span class="keywordflow">return</span> <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>;
<a name="l01750"></a>01750     }
<a name="l01751"></a>01751 
<a name="l01752"></a>01752 <span class="keyword">public</span>:
<a name="l01753"></a>01753     <span class="comment">// *** Standard Access Functions Querying the Tree by Descending to a Leaf</span>
<a name="l01754"></a>01754 <span class="comment"></span>
<a name="l01755"></a>01755 <span class="comment">    /// Non-STL function checking whether a key is in the B+ tree. The same as</span>
<a name="l01756"></a>01756 <span class="comment">    /// (find(k) != end()) or (count() != 0).</span>
<a name="l01757"></a><a class="code" href="a00001.html#a3c1b922d80faa7d5864237b4791a7961">01757</a> <span class="comment"></span>    <span class="keywordtype">bool</span> <a class="code" href="a00001.html#a3c1b922d80faa7d5864237b4791a7961" title="Non-STL function checking whether a key is in the B+ tree.">exists</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;key)<span class="keyword"> const</span>
<a name="l01758"></a>01758 <span class="keyword">    </span>{
<a name="l01759"></a>01759         <span class="keyword">const</span> node *n = <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>;
<a name="l01760"></a>01760         <span class="keywordflow">if</span> (!n) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l01761"></a>01761 
<a name="l01762"></a>01762         <span class="keywordflow">while</span>(!n-&gt;isleafnode())
<a name="l01763"></a>01763         {
<a name="l01764"></a>01764             <span class="keyword">const</span> inner_node *inner = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l01765"></a>01765             <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(inner, key);
<a name="l01766"></a>01766 
<a name="l01767"></a>01767             n = inner-&gt;childid[slot];
<a name="l01768"></a>01768         }
<a name="l01769"></a>01769 
<a name="l01770"></a>01770         <span class="keyword">const</span> leaf_node *leaf = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l01771"></a>01771 
<a name="l01772"></a>01772         <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(leaf, key);
<a name="l01773"></a>01773         <span class="keywordflow">return</span> (slot &lt; leaf-&gt;slotuse &amp;&amp; <a class="code" href="a00001.html#ac3b0c8e750101dfad0ef70c54532dd68" title="True if a == b ? constructed from key_less().">key_equal</a>(key, leaf-&gt;slotkey[slot]));
<a name="l01774"></a>01774     }
<a name="l01775"></a>01775 <span class="comment"></span>
<a name="l01776"></a>01776 <span class="comment">    /// Tries to locate a key in the B+ tree and returns an iterator to the</span>
<a name="l01777"></a>01777 <span class="comment">    /// key/data slot if found. If unsuccessful it returns end().</span>
<a name="l01778"></a><a class="code" href="a00001.html#a90bd85f703bb74d7ab7dc967bf8d712f">01778</a> <span class="comment"></span>    iterator <a class="code" href="a00001.html#a90bd85f703bb74d7ab7dc967bf8d712f" title="Tries to locate a key in the B+ tree and returns an iterator to the key/data slot if found...">find</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;key)
<a name="l01779"></a>01779     {
<a name="l01780"></a>01780         node *n = <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>;
<a name="l01781"></a>01781         <span class="keywordflow">if</span> (!n) <span class="keywordflow">return</span> <a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>();
<a name="l01782"></a>01782 
<a name="l01783"></a>01783         <span class="keywordflow">while</span>(!n-&gt;isleafnode())
<a name="l01784"></a>01784         {
<a name="l01785"></a>01785             <span class="keyword">const</span> inner_node *inner = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l01786"></a>01786             <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(inner, key);
<a name="l01787"></a>01787 
<a name="l01788"></a>01788             n = inner-&gt;childid[slot];
<a name="l01789"></a>01789         }
<a name="l01790"></a>01790 
<a name="l01791"></a>01791         leaf_node *leaf = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l01792"></a>01792 
<a name="l01793"></a>01793         <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(leaf, key);
<a name="l01794"></a>01794         <span class="keywordflow">return</span> (slot &lt; leaf-&gt;slotuse &amp;&amp; <a class="code" href="a00001.html#ac3b0c8e750101dfad0ef70c54532dd68" title="True if a == b ? constructed from key_less().">key_equal</a>(key, leaf-&gt;slotkey[slot]))
<a name="l01795"></a>01795             ? iterator(leaf, slot) : <a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>();
<a name="l01796"></a>01796     }
<a name="l01797"></a>01797 <span class="comment"></span>
<a name="l01798"></a>01798 <span class="comment">    /// Tries to locate a key in the B+ tree and returns an constant iterator</span>
<a name="l01799"></a>01799 <span class="comment">    /// to the key/data slot if found. If unsuccessful it returns end().</span>
<a name="l01800"></a><a class="code" href="a00001.html#a6271881b282c78b6e17fa08de0052d5e">01800</a> <span class="comment"></span>    const_iterator <a class="code" href="a00001.html#a90bd85f703bb74d7ab7dc967bf8d712f" title="Tries to locate a key in the B+ tree and returns an iterator to the key/data slot if found...">find</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;key)<span class="keyword"> const</span>
<a name="l01801"></a>01801 <span class="keyword">    </span>{
<a name="l01802"></a>01802         <span class="keyword">const</span> node *n = <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>;
<a name="l01803"></a>01803         <span class="keywordflow">if</span> (!n) <span class="keywordflow">return</span> <a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>();
<a name="l01804"></a>01804 
<a name="l01805"></a>01805         <span class="keywordflow">while</span>(!n-&gt;isleafnode())
<a name="l01806"></a>01806         {
<a name="l01807"></a>01807             <span class="keyword">const</span> inner_node *inner = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l01808"></a>01808             <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(inner, key);
<a name="l01809"></a>01809 
<a name="l01810"></a>01810             n = inner-&gt;childid[slot];
<a name="l01811"></a>01811         }
<a name="l01812"></a>01812 
<a name="l01813"></a>01813         <span class="keyword">const</span> leaf_node *leaf = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l01814"></a>01814 
<a name="l01815"></a>01815         <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(leaf, key);
<a name="l01816"></a>01816         <span class="keywordflow">return</span> (slot &lt; leaf-&gt;slotuse &amp;&amp; <a class="code" href="a00001.html#ac3b0c8e750101dfad0ef70c54532dd68" title="True if a == b ? constructed from key_less().">key_equal</a>(key, leaf-&gt;slotkey[slot]))
<a name="l01817"></a>01817             ? const_iterator(leaf, slot) : <a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>();
<a name="l01818"></a>01818     }
<a name="l01819"></a>01819 <span class="comment"></span>
<a name="l01820"></a>01820 <span class="comment">    /// Tries to locate a key in the B+ tree and returns the number of</span>
<a name="l01821"></a>01821 <span class="comment">    /// identical key entries found.</span>
<a name="l01822"></a><a class="code" href="a00001.html#a3882a2b0e2ea8eb43b4261e7f3eb32f2">01822</a> <span class="comment"></span>    <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a> <a class="code" href="a00001.html#a3882a2b0e2ea8eb43b4261e7f3eb32f2" title="Tries to locate a key in the B+ tree and returns the number of identical key entries found...">count</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;key)<span class="keyword"> const</span>
<a name="l01823"></a>01823 <span class="keyword">    </span>{
<a name="l01824"></a>01824         <span class="keyword">const</span> node *n = <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>;
<a name="l01825"></a>01825         <span class="keywordflow">if</span> (!n) <span class="keywordflow">return</span> 0;
<a name="l01826"></a>01826 
<a name="l01827"></a>01827         <span class="keywordflow">while</span>(!n-&gt;isleafnode())
<a name="l01828"></a>01828         {
<a name="l01829"></a>01829             <span class="keyword">const</span> inner_node *inner = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l01830"></a>01830             <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(inner, key);
<a name="l01831"></a>01831 
<a name="l01832"></a>01832             n = inner-&gt;childid[slot];
<a name="l01833"></a>01833         }
<a name="l01834"></a>01834 
<a name="l01835"></a>01835         <span class="keyword">const</span> leaf_node *leaf = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l01836"></a>01836 
<a name="l01837"></a>01837         <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(leaf, key);
<a name="l01838"></a>01838         <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a> num = 0;
<a name="l01839"></a>01839 
<a name="l01840"></a>01840         <span class="keywordflow">while</span> (leaf &amp;&amp; slot &lt; leaf-&gt;slotuse &amp;&amp; <a class="code" href="a00001.html#ac3b0c8e750101dfad0ef70c54532dd68" title="True if a == b ? constructed from key_less().">key_equal</a>(key, leaf-&gt;slotkey[slot]))
<a name="l01841"></a>01841         {
<a name="l01842"></a>01842             ++num;
<a name="l01843"></a>01843             <span class="keywordflow">if</span> (++slot &gt;= leaf-&gt;slotuse)
<a name="l01844"></a>01844             {
<a name="l01845"></a>01845                 leaf = leaf-&gt;nextleaf;
<a name="l01846"></a>01846                 slot = 0;
<a name="l01847"></a>01847             }
<a name="l01848"></a>01848         }
<a name="l01849"></a>01849 
<a name="l01850"></a>01850         <span class="keywordflow">return</span> num;
<a name="l01851"></a>01851     }
<a name="l01852"></a>01852 <span class="comment"></span>
<a name="l01853"></a>01853 <span class="comment">    /// Searches the B+ tree and returns an iterator to the first pair</span>
<a name="l01854"></a>01854 <span class="comment">    /// equal to or greater than key, or end() if all keys are smaller.</span>
<a name="l01855"></a><a class="code" href="a00001.html#aa0b7c53085ef7106f3d430d850b4959e">01855</a> <span class="comment"></span>    iterator <a class="code" href="a00001.html#aa0b7c53085ef7106f3d430d850b4959e" title="Searches the B+ tree and returns an iterator to the first pair equal to or greater than key...">lower_bound</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key)
<a name="l01856"></a>01856     {
<a name="l01857"></a>01857         node *n = <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>;
<a name="l01858"></a>01858         <span class="keywordflow">if</span> (!n) <span class="keywordflow">return</span> <a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>();
<a name="l01859"></a>01859 
<a name="l01860"></a>01860         <span class="keywordflow">while</span>(!n-&gt;isleafnode())
<a name="l01861"></a>01861         {
<a name="l01862"></a>01862             <span class="keyword">const</span> inner_node *inner = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l01863"></a>01863             <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(inner, key);
<a name="l01864"></a>01864 
<a name="l01865"></a>01865             n = inner-&gt;childid[slot];
<a name="l01866"></a>01866         }
<a name="l01867"></a>01867 
<a name="l01868"></a>01868         leaf_node *leaf = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l01869"></a>01869 
<a name="l01870"></a>01870         <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(leaf, key);
<a name="l01871"></a>01871         <span class="keywordflow">return</span> iterator(leaf, slot);
<a name="l01872"></a>01872     }
<a name="l01873"></a>01873 <span class="comment"></span>
<a name="l01874"></a>01874 <span class="comment">    /// Searches the B+ tree and returns a constant iterator to the</span>
<a name="l01875"></a>01875 <span class="comment">    /// first pair equal to or greater than key, or end() if all keys</span>
<a name="l01876"></a>01876 <span class="comment">    /// are smaller.</span>
<a name="l01877"></a><a class="code" href="a00001.html#a534f04efcbc017d34df9dfa9ad0e4047">01877</a> <span class="comment"></span>    const_iterator <a class="code" href="a00001.html#aa0b7c53085ef7106f3d430d850b4959e" title="Searches the B+ tree and returns an iterator to the first pair equal to or greater than key...">lower_bound</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key)<span class="keyword"> const</span>
<a name="l01878"></a>01878 <span class="keyword">    </span>{
<a name="l01879"></a>01879         <span class="keyword">const</span> node *n = <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>;
<a name="l01880"></a>01880         <span class="keywordflow">if</span> (!n) <span class="keywordflow">return</span> <a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>();
<a name="l01881"></a>01881 
<a name="l01882"></a>01882         <span class="keywordflow">while</span>(!n-&gt;isleafnode())
<a name="l01883"></a>01883         {
<a name="l01884"></a>01884             <span class="keyword">const</span> inner_node *inner = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l01885"></a>01885             <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(inner, key);
<a name="l01886"></a>01886 
<a name="l01887"></a>01887             n = inner-&gt;childid[slot];
<a name="l01888"></a>01888         }
<a name="l01889"></a>01889 
<a name="l01890"></a>01890         <span class="keyword">const</span> leaf_node *leaf = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l01891"></a>01891 
<a name="l01892"></a>01892         <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(leaf, key);
<a name="l01893"></a>01893         <span class="keywordflow">return</span> const_iterator(leaf, slot);
<a name="l01894"></a>01894     }
<a name="l01895"></a>01895 <span class="comment"></span>
<a name="l01896"></a>01896 <span class="comment">    /// Searches the B+ tree and returns an iterator to the first pair</span>
<a name="l01897"></a>01897 <span class="comment">    /// greater than key, or end() if all keys are smaller or equal.</span>
<a name="l01898"></a><a class="code" href="a00001.html#a0404bb704466a149ea96613b7c5ef3e2">01898</a> <span class="comment"></span>    iterator <a class="code" href="a00001.html#a0404bb704466a149ea96613b7c5ef3e2" title="Searches the B+ tree and returns an iterator to the first pair greater than key, or end() if all keys...">upper_bound</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key)
<a name="l01899"></a>01899     {
<a name="l01900"></a>01900         node *n = <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>;
<a name="l01901"></a>01901         <span class="keywordflow">if</span> (!n) <span class="keywordflow">return</span> <a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>();
<a name="l01902"></a>01902 
<a name="l01903"></a>01903         <span class="keywordflow">while</span>(!n-&gt;isleafnode())
<a name="l01904"></a>01904         {
<a name="l01905"></a>01905             <span class="keyword">const</span> inner_node *inner = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l01906"></a>01906             <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a46ff197e60365a8cad59fd72f935b59c" title="Searches for the first key in the node n greater than key.">find_upper</a>(inner, key);
<a name="l01907"></a>01907 
<a name="l01908"></a>01908             n = inner-&gt;childid[slot];
<a name="l01909"></a>01909         }
<a name="l01910"></a>01910 
<a name="l01911"></a>01911         leaf_node *leaf = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l01912"></a>01912 
<a name="l01913"></a>01913         <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a46ff197e60365a8cad59fd72f935b59c" title="Searches for the first key in the node n greater than key.">find_upper</a>(leaf, key);
<a name="l01914"></a>01914         <span class="keywordflow">return</span> iterator(leaf, slot);
<a name="l01915"></a>01915     }
<a name="l01916"></a>01916 <span class="comment"></span>
<a name="l01917"></a>01917 <span class="comment">    /// Searches the B+ tree and returns a constant iterator to the</span>
<a name="l01918"></a>01918 <span class="comment">    /// first pair greater than key, or end() if all keys are smaller</span>
<a name="l01919"></a>01919 <span class="comment">    /// or equal.</span>
<a name="l01920"></a><a class="code" href="a00001.html#a264d9835af5474e009eee3b617fa1411">01920</a> <span class="comment"></span>    const_iterator <a class="code" href="a00001.html#a0404bb704466a149ea96613b7c5ef3e2" title="Searches the B+ tree and returns an iterator to the first pair greater than key, or end() if all keys...">upper_bound</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key)<span class="keyword"> const</span>
<a name="l01921"></a>01921 <span class="keyword">    </span>{
<a name="l01922"></a>01922         <span class="keyword">const</span> node *n = <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>;
<a name="l01923"></a>01923         <span class="keywordflow">if</span> (!n) <span class="keywordflow">return</span> <a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>();
<a name="l01924"></a>01924 
<a name="l01925"></a>01925         <span class="keywordflow">while</span>(!n-&gt;isleafnode())
<a name="l01926"></a>01926         {
<a name="l01927"></a>01927             <span class="keyword">const</span> inner_node *inner = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l01928"></a>01928             <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a46ff197e60365a8cad59fd72f935b59c" title="Searches for the first key in the node n greater than key.">find_upper</a>(inner, key);
<a name="l01929"></a>01929 
<a name="l01930"></a>01930             n = inner-&gt;childid[slot];
<a name="l01931"></a>01931         }
<a name="l01932"></a>01932 
<a name="l01933"></a>01933         <span class="keyword">const</span> leaf_node *leaf = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l01934"></a>01934 
<a name="l01935"></a>01935         <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a46ff197e60365a8cad59fd72f935b59c" title="Searches for the first key in the node n greater than key.">find_upper</a>(leaf, key);
<a name="l01936"></a>01936         <span class="keywordflow">return</span> const_iterator(leaf, slot);
<a name="l01937"></a>01937     }
<a name="l01938"></a>01938 <span class="comment"></span>
<a name="l01939"></a>01939 <span class="comment">    /// Searches the B+ tree and returns both lower_bound() and upper_bound().</span>
<a name="l01940"></a><a class="code" href="a00001.html#ac73cf4621b0650fef2ea3ea1d2fd2f90">01940</a> <span class="comment"></span>    <span class="keyword">inline</span> std::pair&lt;iterator, iterator&gt; <a class="code" href="a00001.html#ac73cf4621b0650fef2ea3ea1d2fd2f90" title="Searches the B+ tree and returns both lower_bound() and upper_bound().">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key)
<a name="l01941"></a>01941     {
<a name="l01942"></a>01942         <span class="keywordflow">return</span> std::pair&lt;iterator, iterator&gt;(<a class="code" href="a00001.html#aa0b7c53085ef7106f3d430d850b4959e" title="Searches the B+ tree and returns an iterator to the first pair equal to or greater than key...">lower_bound</a>(key), <a class="code" href="a00001.html#a0404bb704466a149ea96613b7c5ef3e2" title="Searches the B+ tree and returns an iterator to the first pair greater than key, or end() if all keys...">upper_bound</a>(key));
<a name="l01943"></a>01943     }
<a name="l01944"></a>01944 <span class="comment"></span>
<a name="l01945"></a>01945 <span class="comment">    /// Searches the B+ tree and returns both lower_bound() and upper_bound().</span>
<a name="l01946"></a><a class="code" href="a00001.html#aed04d2ca76fe26b8a103abe8d988f4af">01946</a> <span class="comment"></span>    <span class="keyword">inline</span> std::pair&lt;const_iterator, const_iterator&gt; <a class="code" href="a00001.html#ac73cf4621b0650fef2ea3ea1d2fd2f90" title="Searches the B+ tree and returns both lower_bound() and upper_bound().">equal_range</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key)<span class="keyword"> const</span>
<a name="l01947"></a>01947 <span class="keyword">    </span>{
<a name="l01948"></a>01948         <span class="keywordflow">return</span> std::pair&lt;const_iterator, const_iterator&gt;(<a class="code" href="a00001.html#aa0b7c53085ef7106f3d430d850b4959e" title="Searches the B+ tree and returns an iterator to the first pair equal to or greater than key...">lower_bound</a>(key), <a class="code" href="a00001.html#a0404bb704466a149ea96613b7c5ef3e2" title="Searches the B+ tree and returns an iterator to the first pair greater than key, or end() if all keys...">upper_bound</a>(key));
<a name="l01949"></a>01949     }
<a name="l01950"></a>01950 
<a name="l01951"></a>01951 <span class="keyword">public</span>:
<a name="l01952"></a>01952     <span class="comment">// *** B+ Tree Object Comparison Functions</span>
<a name="l01953"></a>01953 <span class="comment"></span>
<a name="l01954"></a>01954 <span class="comment">    /// Equality relation of B+ trees of the same type. B+ trees of the same</span>
<a name="l01955"></a>01955 <span class="comment">    /// size and equal elements (both key and data) are considered</span>
<a name="l01956"></a>01956 <span class="comment">    /// equal. Beware of the random ordering of duplicate keys.</span>
<a name="l01957"></a><a class="code" href="a00001.html#af0c66916cc7315b98213bb0a276ad1c5">01957</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00001.html#af0c66916cc7315b98213bb0a276ad1c5" title="Equality relation of B+ trees of the same type.">operator==</a>(<span class="keyword">const</span> <a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree_self</a> &amp;other)<span class="keyword"> const</span>
<a name="l01958"></a>01958 <span class="keyword">    </span>{
<a name="l01959"></a>01959         <span class="keywordflow">return</span> (<a class="code" href="a00001.html#a3942d7144bc93cf094b62f03e6113f4e" title="Return the number of key/data pairs in the B+ tree.">size</a>() == other.<a class="code" href="a00001.html#a3942d7144bc93cf094b62f03e6113f4e" title="Return the number of key/data pairs in the B+ tree.">size</a>()) &amp;&amp; std::equal(<a class="code" href="a00001.html#a564a6ea78bcc0de0bbc1fdff65f547fd" title="Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree...">begin</a>(), <a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>(), other.<a class="code" href="a00001.html#a564a6ea78bcc0de0bbc1fdff65f547fd" title="Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree...">begin</a>());
<a name="l01960"></a>01960     }
<a name="l01961"></a>01961 <span class="comment"></span>
<a name="l01962"></a>01962 <span class="comment">    /// Inequality relation. Based on operator==.</span>
<a name="l01963"></a><a class="code" href="a00001.html#aa8d82a57e9d983487477fbab491fe77b">01963</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00001.html#aa8d82a57e9d983487477fbab491fe77b" title="Inequality relation. Based on operator==.">operator!=</a>(<span class="keyword">const</span> <a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree_self</a> &amp;other)<span class="keyword"> const</span>
<a name="l01964"></a>01964 <span class="keyword">    </span>{
<a name="l01965"></a>01965         <span class="keywordflow">return</span> !(*<span class="keyword">this</span> == other);
<a name="l01966"></a>01966     }
<a name="l01967"></a>01967 <span class="comment"></span>
<a name="l01968"></a>01968 <span class="comment">    /// Total ordering relation of B+ trees of the same type. It uses</span>
<a name="l01969"></a>01969 <span class="comment">    /// std::lexicographical_compare() for the actual comparison of elements.</span>
<a name="l01970"></a><a class="code" href="a00001.html#a0861b6d445c1701ef81625676b88d08f">01970</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00001.html#a0861b6d445c1701ef81625676b88d08f" title="Total ordering relation of B+ trees of the same type.">operator&lt;</a>(<span class="keyword">const</span> <a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree_self</a> &amp;other)<span class="keyword"> const</span>
<a name="l01971"></a>01971 <span class="keyword">    </span>{
<a name="l01972"></a>01972         <span class="keywordflow">return</span> std::lexicographical_compare(<a class="code" href="a00001.html#a564a6ea78bcc0de0bbc1fdff65f547fd" title="Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree...">begin</a>(), <a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>(), other.<a class="code" href="a00001.html#a564a6ea78bcc0de0bbc1fdff65f547fd" title="Constructs a read/data-write iterator that points to the first slot in the first leaf of the B+ tree...">begin</a>(), other.<a class="code" href="a00001.html#a8f1fbaf7eabefca66188e2bf6996573d" title="Constructs a read/data-write iterator that points to the first invalid slot in the last leaf of the B...">end</a>());
<a name="l01973"></a>01973     }
<a name="l01974"></a>01974 <span class="comment"></span>
<a name="l01975"></a>01975 <span class="comment">    /// Greater relation. Based on operator&lt;.</span>
<a name="l01976"></a><a class="code" href="a00001.html#aac294ce4d54a06978bb1bd1cb6b61994">01976</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00001.html#aac294ce4d54a06978bb1bd1cb6b61994" title="Greater relation. Based on operator&lt;.">operator&gt;</a>(<span class="keyword">const</span> <a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree_self</a> &amp;other)<span class="keyword"> const</span>
<a name="l01977"></a>01977 <span class="keyword">    </span>{
<a name="l01978"></a>01978         <span class="keywordflow">return</span> other &lt; *<span class="keyword">this</span>;
<a name="l01979"></a>01979     }
<a name="l01980"></a>01980 <span class="comment"></span>
<a name="l01981"></a>01981 <span class="comment">    /// Less-equal relation. Based on operator&lt;.</span>
<a name="l01982"></a><a class="code" href="a00001.html#a9547e921eb277c76a7c5707668bcdb3d">01982</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00001.html#a9547e921eb277c76a7c5707668bcdb3d" title="Less-equal relation. Based on operator&lt;.">operator&lt;=</a>(<span class="keyword">const</span> <a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree_self</a> &amp;other)<span class="keyword"> const</span>
<a name="l01983"></a>01983 <span class="keyword">    </span>{
<a name="l01984"></a>01984         <span class="keywordflow">return</span> !(other &lt; *<span class="keyword">this</span>);
<a name="l01985"></a>01985     }
<a name="l01986"></a>01986 <span class="comment"></span>
<a name="l01987"></a>01987 <span class="comment">    /// Greater-equal relation. Based on operator&lt;.</span>
<a name="l01988"></a><a class="code" href="a00001.html#a820ebeacf8619198969de50fd3a406a3">01988</a> <span class="comment"></span>    <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00001.html#a820ebeacf8619198969de50fd3a406a3" title="Greater-equal relation. Based on operator&lt;.">operator&gt;=</a>(<span class="keyword">const</span> <a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree_self</a> &amp;other)<span class="keyword"> const</span>
<a name="l01989"></a>01989 <span class="keyword">    </span>{
<a name="l01990"></a>01990         <span class="keywordflow">return</span> !(*<span class="keyword">this</span> &lt; other);
<a name="l01991"></a>01991     }
<a name="l01992"></a>01992 
<a name="l01993"></a>01993 <span class="keyword">public</span>:<span class="comment"></span>
<a name="l01994"></a>01994 <span class="comment">    /// *** Fast Copy: Assign Operator and Copy Constructors</span>
<a name="l01995"></a>01995 <span class="comment"></span><span class="comment"></span>
<a name="l01996"></a>01996 <span class="comment">    /// Assignment operator. All the key/data pairs are copied</span>
<a name="l01997"></a><a class="code" href="a00001.html#a888dd89447d0a1ad66276c208e52f348">01997</a> <span class="comment"></span>    <span class="keyword">inline</span> <a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree_self</a>&amp; <a class="code" href="a00001.html#a888dd89447d0a1ad66276c208e52f348" title="*** Fast Copy: Assign Operator and Copy Constructors">operator= </a>(<span class="keyword">const</span> <a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree_self</a> &amp;other)
<a name="l01998"></a>01998     {
<a name="l01999"></a>01999         <span class="keywordflow">if</span> (<span class="keyword">this</span> != &amp;other)
<a name="l02000"></a>02000         {
<a name="l02001"></a>02001             <a class="code" href="a00001.html#aa2acf975007740100b9803fcea573036" title="Frees all key/data pairs and all nodes of the tree.">clear</a>();
<a name="l02002"></a>02002 
<a name="l02003"></a>02003             <a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a> = other.<a class="code" href="a00001.html#a6200a8a00989f77f053e1200da7f816b" title="Constant access to the key comparison object sorting the B+ tree.">key_comp</a>();
<a name="l02004"></a>02004             <a class="code" href="a00001.html#a36368c13e6be2feca3cbcc0aa8950b64" title="Memory allocator.">m_allocator</a> = other.<a class="code" href="a00001.html#ad7b097e1a4301e319d8a7e6f6bb661fd" title="Return the base node allocator provided during construction.">get_allocator</a>();
<a name="l02005"></a>02005 
<a name="l02006"></a>02006             <span class="keywordflow">if</span> (other.<a class="code" href="a00001.html#a3942d7144bc93cf094b62f03e6113f4e" title="Return the number of key/data pairs in the B+ tree.">size</a>() != 0)
<a name="l02007"></a>02007             {
<a name="l02008"></a>02008                 <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#aa4d4f72b9a8f7a58424063aa1d4a1fcc" title="Number of leaves in the B+ tree.">leaves</a> = <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#ab63b03a814b985680a46151fd9f59e17" title="Number of inner nodes in the B+ tree.">innernodes</a> = 0;
<a name="l02009"></a>02009                 <span class="keywordflow">if</span> (other.<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>) {
<a name="l02010"></a>02010                     <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> = <a class="code" href="a00001.html#abf107ac5589a59a068bdc648f02bf353" title="Recursively copy nodes from another B+ tree object.">copy_recursive</a>(other.<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l02011"></a>02011                 }
<a name="l02012"></a>02012                 <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a> = other.<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>;
<a name="l02013"></a>02013             }
<a name="l02014"></a>02014 
<a name="l02015"></a>02015             <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>) <a class="code" href="a00001.html#ad7008114b409fe53a5739a69f3b90e59" title="Run a thorough verification of all B+ tree invariants.">verify</a>();
<a name="l02016"></a>02016         }
<a name="l02017"></a>02017         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l02018"></a>02018     }
<a name="l02019"></a>02019 <span class="comment"></span>
<a name="l02020"></a>02020 <span class="comment">    /// Copy constructor. The newly initialized B+ tree object will contain a</span>
<a name="l02021"></a>02021 <span class="comment">    /// copy of all key/data pairs.</span>
<a name="l02022"></a><a class="code" href="a00001.html#a34a7b277c27f485c2237bdc73888ec74">02022</a> <span class="comment"></span>    <span class="keyword">inline</span> <a class="code" href="a00001.html#ab8d4b1a025d08beb515f5e3a8033deb4" title="Default constructor initializing an empty B+ tree with the standard key comparison function...">btree</a>(<span class="keyword">const</span> <a class="code" href="a00001.html" title="Basic class implementing a base B+ tree data structure in memory.">btree_self</a> &amp;other)
<a name="l02023"></a>02023         : <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>(NULL), <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>(NULL), <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>(NULL),
<a name="l02024"></a>02024           <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>( other.<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a> ),
<a name="l02025"></a>02025           <a class="code" href="a00001.html#ab2994c7f5b38e618e894129e596d79d1" title="Key comparison object.">m_key_less</a>( other.<a class="code" href="a00001.html#a6200a8a00989f77f053e1200da7f816b" title="Constant access to the key comparison object sorting the B+ tree.">key_comp</a>() ),
<a name="l02026"></a>02026           <a class="code" href="a00001.html#a36368c13e6be2feca3cbcc0aa8950b64" title="Memory allocator.">m_allocator</a>( other.<a class="code" href="a00001.html#ad7b097e1a4301e319d8a7e6f6bb661fd" title="Return the base node allocator provided during construction.">get_allocator</a>() )
<a name="l02027"></a>02027     {
<a name="l02028"></a>02028         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a3942d7144bc93cf094b62f03e6113f4e" title="Return the number of key/data pairs in the B+ tree.">size</a>() &gt; 0)
<a name="l02029"></a>02029         {
<a name="l02030"></a>02030             <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#aa4d4f72b9a8f7a58424063aa1d4a1fcc" title="Number of leaves in the B+ tree.">leaves</a> = <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#ab63b03a814b985680a46151fd9f59e17" title="Number of inner nodes in the B+ tree.">innernodes</a> = 0;
<a name="l02031"></a>02031             <span class="keywordflow">if</span> (other.<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>) {
<a name="l02032"></a>02032                 <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> = <a class="code" href="a00001.html#abf107ac5589a59a068bdc648f02bf353" title="Recursively copy nodes from another B+ tree object.">copy_recursive</a>(other.<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l02033"></a>02033             }
<a name="l02034"></a>02034             <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>) <a class="code" href="a00001.html#ad7008114b409fe53a5739a69f3b90e59" title="Run a thorough verification of all B+ tree invariants.">verify</a>();
<a name="l02035"></a>02035         }
<a name="l02036"></a>02036     }
<a name="l02037"></a>02037 
<a name="l02038"></a>02038 <span class="keyword">private</span>:<span class="comment"></span>
<a name="l02039"></a>02039 <span class="comment">    /// Recursively copy nodes from another B+ tree object</span>
<a name="l02040"></a><a class="code" href="a00001.html#abf107ac5589a59a068bdc648f02bf353">02040</a> <span class="comment"></span>    <span class="keyword">struct </span>node* <a class="code" href="a00001.html#abf107ac5589a59a068bdc648f02bf353" title="Recursively copy nodes from another B+ tree object.">copy_recursive</a>(<span class="keyword">const</span> node *n)
<a name="l02041"></a>02041     {
<a name="l02042"></a>02042         <span class="keywordflow">if</span> (n-&gt;isleafnode())
<a name="l02043"></a>02043         {
<a name="l02044"></a>02044             <span class="keyword">const</span> leaf_node *leaf = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l02045"></a>02045             leaf_node *newleaf = <a class="code" href="a00001.html#ab6ff4b0f13f48e417a45431318a00337" title="Allocate and initialize a leaf node.">allocate_leaf</a>();
<a name="l02046"></a>02046 
<a name="l02047"></a>02047             newleaf-&gt;slotuse = leaf-&gt;slotuse;
<a name="l02048"></a>02048             std::copy(leaf-&gt;slotkey, leaf-&gt;slotkey + leaf-&gt;slotuse, newleaf-&gt;slotkey);
<a name="l02049"></a>02049             <a class="code" href="a00001.html#ad8a89e088fbfedec4218ea46f8899941" title="Convenient template function for conditional copying of slotdata.">data_copy</a>(leaf-&gt;slotdata, leaf-&gt;slotdata + leaf-&gt;slotuse, newleaf-&gt;slotdata);
<a name="l02050"></a>02050 
<a name="l02051"></a>02051             <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a> == NULL)
<a name="l02052"></a>02052             {
<a name="l02053"></a>02053                 <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a> = <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> = newleaf;
<a name="l02054"></a>02054                 newleaf-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> = newleaf-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a> = NULL;
<a name="l02055"></a>02055             }
<a name="l02056"></a>02056             <span class="keywordflow">else</span>
<a name="l02057"></a>02057             {
<a name="l02058"></a>02058                 newleaf-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> = <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>;
<a name="l02059"></a>02059                 <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a> = newleaf;
<a name="l02060"></a>02060                 <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> = newleaf;
<a name="l02061"></a>02061             }
<a name="l02062"></a>02062 
<a name="l02063"></a>02063             <span class="keywordflow">return</span> newleaf;
<a name="l02064"></a>02064         }
<a name="l02065"></a>02065         <span class="keywordflow">else</span>
<a name="l02066"></a>02066         {
<a name="l02067"></a>02067             <span class="keyword">const</span> inner_node *inner = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l02068"></a>02068             inner_node *newinner = <a class="code" href="a00001.html#a1bf04093f2dc2a1cb57955ff55d3762a" title="Allocate and initialize an inner node.">allocate_inner</a>(inner-&gt;level);
<a name="l02069"></a>02069 
<a name="l02070"></a>02070             newinner-&gt;slotuse = inner-&gt;slotuse;
<a name="l02071"></a>02071             std::copy(inner-&gt;slotkey, inner-&gt;slotkey + inner-&gt;slotuse, newinner-&gt;slotkey);
<a name="l02072"></a>02072 
<a name="l02073"></a>02073             <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> slot = 0; slot &lt;= inner-&gt;slotuse; ++slot)
<a name="l02074"></a>02074             {
<a name="l02075"></a>02075                 newinner-&gt;childid[slot] = <a class="code" href="a00001.html#abf107ac5589a59a068bdc648f02bf353" title="Recursively copy nodes from another B+ tree object.">copy_recursive</a>(inner-&gt;childid[slot]);
<a name="l02076"></a>02076             }
<a name="l02077"></a>02077 
<a name="l02078"></a>02078             <span class="keywordflow">return</span> newinner;
<a name="l02079"></a>02079         }
<a name="l02080"></a>02080     }
<a name="l02081"></a>02081 
<a name="l02082"></a>02082 <span class="keyword">public</span>:
<a name="l02083"></a>02083     <span class="comment">// *** Public Insertion Functions</span>
<a name="l02084"></a>02084 <span class="comment"></span>
<a name="l02085"></a>02085 <span class="comment">    /// Attempt to insert a key/data pair into the B+ tree. If the tree does not</span>
<a name="l02086"></a>02086 <span class="comment">    /// allow duplicate keys, then the insert may fail if it is already</span>
<a name="l02087"></a>02087 <span class="comment">    /// present.</span>
<a name="l02088"></a><a class="code" href="a00001.html#a29d3aa8b03d2def35a358aebb2853053">02088</a> <span class="comment"></span>    <span class="keyword">inline</span> std::pair&lt;iterator, bool&gt; <a class="code" href="a00001.html#a29d3aa8b03d2def35a358aebb2853053" title="Attempt to insert a key/data pair into the B+ tree.">insert</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a2cddd431e50047766f45902b9f6f5c31" title="The pair of key_type and data_type, this may be different from value_type.">pair_type</a>&amp; x)
<a name="l02089"></a>02089     {
<a name="l02090"></a>02090         <span class="keywordflow">return</span> <a class="code" href="a00001.html#a0ec1af7db81bf48c6542eca6a126b991" title="Start the insertion descent at the current root and handle root splits.">insert_start</a>(x.first, x.second);
<a name="l02091"></a>02091     }
<a name="l02092"></a>02092 <span class="comment"></span>
<a name="l02093"></a>02093 <span class="comment">    /// Attempt to insert a key/data pair into the B+ tree. Beware that if</span>
<a name="l02094"></a>02094 <span class="comment">    /// key_type == data_type, then the template iterator insert() is called</span>
<a name="l02095"></a>02095 <span class="comment">    /// instead. If the tree does not allow duplicate keys, then the insert may</span>
<a name="l02096"></a>02096 <span class="comment">    /// fail if it is already present.</span>
<a name="l02097"></a><a class="code" href="a00001.html#a3728a56b1c508547d13420d4d2e6054c">02097</a> <span class="comment"></span>    <span class="keyword">inline</span> std::pair&lt;iterator, bool&gt; <a class="code" href="a00001.html#a29d3aa8b03d2def35a358aebb2853053" title="Attempt to insert a key/data pair into the B+ tree.">insert</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key, <span class="keyword">const</span> <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">data_type</a>&amp; data)
<a name="l02098"></a>02098     {
<a name="l02099"></a>02099         <span class="keywordflow">return</span> <a class="code" href="a00001.html#a0ec1af7db81bf48c6542eca6a126b991" title="Start the insertion descent at the current root and handle root splits.">insert_start</a>(key, data);
<a name="l02100"></a>02100     }
<a name="l02101"></a>02101 <span class="comment"></span>
<a name="l02102"></a>02102 <span class="comment">    /// Attempt to insert a key/data pair into the B+ tree. This function is the</span>
<a name="l02103"></a>02103 <span class="comment">    /// same as the other insert, however if key_type == data_type then the</span>
<a name="l02104"></a>02104 <span class="comment">    /// non-template function cannot be called. If the tree does not allow</span>
<a name="l02105"></a>02105 <span class="comment">    /// duplicate keys, then the insert may fail if it is already present.</span>
<a name="l02106"></a><a class="code" href="a00001.html#a586dd230f8be24eaeebc75cc95196d78">02106</a> <span class="comment"></span>    <span class="keyword">inline</span> std::pair&lt;iterator, bool&gt; <a class="code" href="a00001.html#a586dd230f8be24eaeebc75cc95196d78" title="Attempt to insert a key/data pair into the B+ tree.">insert2</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key, <span class="keyword">const</span> <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">data_type</a>&amp; data)
<a name="l02107"></a>02107     {
<a name="l02108"></a>02108         <span class="keywordflow">return</span> <a class="code" href="a00001.html#a0ec1af7db81bf48c6542eca6a126b991" title="Start the insertion descent at the current root and handle root splits.">insert_start</a>(key, data);
<a name="l02109"></a>02109     }
<a name="l02110"></a>02110 <span class="comment"></span>
<a name="l02111"></a>02111 <span class="comment">    /// Attempt to insert a key/data pair into the B+ tree. The iterator hint</span>
<a name="l02112"></a>02112 <span class="comment">    /// is currently ignored by the B+ tree insertion routine.</span>
<a name="l02113"></a><a class="code" href="a00001.html#a21d7a0745168857083ca888c5539275b">02113</a> <span class="comment"></span>    <span class="keyword">inline</span> iterator <a class="code" href="a00001.html#a29d3aa8b03d2def35a358aebb2853053" title="Attempt to insert a key/data pair into the B+ tree.">insert</a>(iterator <span class="comment">/* hint */</span>, <span class="keyword">const</span> <a class="code" href="a00001.html#a2cddd431e50047766f45902b9f6f5c31" title="The pair of key_type and data_type, this may be different from value_type.">pair_type</a> &amp;x)
<a name="l02114"></a>02114     {
<a name="l02115"></a>02115         <span class="keywordflow">return</span> <a class="code" href="a00001.html#a0ec1af7db81bf48c6542eca6a126b991" title="Start the insertion descent at the current root and handle root splits.">insert_start</a>(x.first, x.second).first;
<a name="l02116"></a>02116     }
<a name="l02117"></a>02117 <span class="comment"></span>
<a name="l02118"></a>02118 <span class="comment">    /// Attempt to insert a key/data pair into the B+ tree. The iterator hint is</span>
<a name="l02119"></a>02119 <span class="comment">    /// currently ignored by the B+ tree insertion routine.</span>
<a name="l02120"></a><a class="code" href="a00001.html#a255994ba0a472e0d8f13fea2951d63f9">02120</a> <span class="comment"></span>    <span class="keyword">inline</span> iterator <a class="code" href="a00001.html#a586dd230f8be24eaeebc75cc95196d78" title="Attempt to insert a key/data pair into the B+ tree.">insert2</a>(iterator <span class="comment">/* hint */</span>, <span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key, <span class="keyword">const</span> <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">data_type</a>&amp; data)
<a name="l02121"></a>02121     {
<a name="l02122"></a>02122         <span class="keywordflow">return</span> <a class="code" href="a00001.html#a0ec1af7db81bf48c6542eca6a126b991" title="Start the insertion descent at the current root and handle root splits.">insert_start</a>(key, data).first;
<a name="l02123"></a>02123     }
<a name="l02124"></a>02124 <span class="comment"></span>
<a name="l02125"></a>02125 <span class="comment">    /// Attempt to insert the range [first,last) of value_type pairs into the</span>
<a name="l02126"></a>02126 <span class="comment">    /// B+ tree. Each key/data pair is inserted individually; to bulk load the</span>
<a name="l02127"></a>02127 <span class="comment">    /// tree, use a constructor with range.</span>
<a name="l02128"></a>02128 <span class="comment"></span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> InputIterator&gt;
<a name="l02129"></a><a class="code" href="a00001.html#aa72caeff37728fa324ed4ea406cee57b">02129</a>     <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="a00001.html#a29d3aa8b03d2def35a358aebb2853053" title="Attempt to insert a key/data pair into the B+ tree.">insert</a>(InputIterator first, InputIterator last)
<a name="l02130"></a>02130     {
<a name="l02131"></a>02131         InputIterator iter = first;
<a name="l02132"></a>02132         <span class="keywordflow">while</span>(iter != last)
<a name="l02133"></a>02133         {
<a name="l02134"></a>02134             <a class="code" href="a00001.html#a29d3aa8b03d2def35a358aebb2853053" title="Attempt to insert a key/data pair into the B+ tree.">insert</a>(*iter);
<a name="l02135"></a>02135             ++iter;
<a name="l02136"></a>02136         }
<a name="l02137"></a>02137     }
<a name="l02138"></a>02138 
<a name="l02139"></a>02139 <span class="keyword">private</span>:
<a name="l02140"></a>02140     <span class="comment">// *** Private Insertion Functions</span>
<a name="l02141"></a>02141 <span class="comment"></span>
<a name="l02142"></a>02142 <span class="comment">    /// Start the insertion descent at the current root and handle root</span>
<a name="l02143"></a>02143 <span class="comment">    /// splits. Returns true if the item was inserted</span>
<a name="l02144"></a><a class="code" href="a00001.html#a0ec1af7db81bf48c6542eca6a126b991">02144</a> <span class="comment"></span>    std::pair&lt;iterator, bool&gt; <a class="code" href="a00001.html#a0ec1af7db81bf48c6542eca6a126b991" title="Start the insertion descent at the current root and handle root splits.">insert_start</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key, <span class="keyword">const</span> <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">data_type</a>&amp; value)
<a name="l02145"></a>02145     {
<a name="l02146"></a>02146         node *newchild = NULL;
<a name="l02147"></a>02147         <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> newkey = <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>();
<a name="l02148"></a>02148 
<a name="l02149"></a>02149         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> == NULL) {
<a name="l02150"></a>02150             <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> = <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a> = <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> = <a class="code" href="a00001.html#ab6ff4b0f13f48e417a45431318a00337" title="Allocate and initialize a leaf node.">allocate_leaf</a>();
<a name="l02151"></a>02151         }
<a name="l02152"></a>02152 
<a name="l02153"></a>02153         std::pair&lt;iterator, bool&gt; r = <a class="code" href="a00001.html#a07898a6b8d2fcc51dc713c1096ce8fdf" title="Insert an item into the B+ tree.">insert_descend</a>(<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>, key, value, &amp;newkey, &amp;newchild);
<a name="l02154"></a>02154 
<a name="l02155"></a>02155         <span class="keywordflow">if</span> (newchild)
<a name="l02156"></a>02156         {
<a name="l02157"></a>02157             inner_node *newroot = <a class="code" href="a00001.html#a1bf04093f2dc2a1cb57955ff55d3762a" title="Allocate and initialize an inner node.">allocate_inner</a>(<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>-&gt;<a class="code" href="a00018.html#a9204f647e868560552dddc001aac8a55" title="Level in the b-tree, if level == 0 -&gt; leaf node.">level</a> + 1);
<a name="l02158"></a>02158             newroot-&gt;slotkey[0] = newkey;
<a name="l02159"></a>02159 
<a name="l02160"></a>02160             newroot-&gt;childid[0] = <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>;
<a name="l02161"></a>02161             newroot-&gt;childid[1] = newchild;
<a name="l02162"></a>02162 
<a name="l02163"></a>02163             newroot-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> = 1;
<a name="l02164"></a>02164 
<a name="l02165"></a>02165             <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> = newroot;
<a name="l02166"></a>02166         }
<a name="l02167"></a>02167 
<a name="l02168"></a>02168         <span class="comment">// increment itemcount if the item was inserted</span>
<a name="l02169"></a>02169         <span class="keywordflow">if</span> (r.second) ++<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a>;
<a name="l02170"></a>02170 
<a name="l02171"></a>02171 <span class="preprocessor">#ifdef BTREE_DEBUG</span>
<a name="l02172"></a>02172 <span class="preprocessor"></span>        <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a224f31a88d50490e14f0f291d70ef2fc" title="Debug parameter: Prints out lots of debug information about how the algorithms change the tree...">debug</a>) <a class="code" href="a00001.html#a29af931b81dc3446d1ffadab6fd5e017" title="Print out the B+ tree structure with keys onto the given ostream.">print</a>(std::cout);
<a name="l02173"></a>02173 <span class="preprocessor">#endif</span>
<a name="l02174"></a>02174 <span class="preprocessor"></span>
<a name="l02175"></a>02175         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>) {
<a name="l02176"></a>02176             <a class="code" href="a00001.html#ad7008114b409fe53a5739a69f3b90e59" title="Run a thorough verification of all B+ tree invariants.">verify</a>();
<a name="l02177"></a>02177             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00001.html#a3c1b922d80faa7d5864237b4791a7961" title="Non-STL function checking whether a key is in the B+ tree.">exists</a>(key));
<a name="l02178"></a>02178         }
<a name="l02179"></a>02179 
<a name="l02180"></a>02180         <span class="keywordflow">return</span> r;
<a name="l02181"></a>02181     }
<a name="l02182"></a>02182 <span class="comment"></span>
<a name="l02183"></a>02183 <span class="comment">    /**</span>
<a name="l02184"></a>02184 <span class="comment">     * @brief Insert an item into the B+ tree.</span>
<a name="l02185"></a>02185 <span class="comment">     *</span>
<a name="l02186"></a>02186 <span class="comment">     * Descend down the nodes to a leaf, insert the key/data pair in a free</span>
<a name="l02187"></a>02187 <span class="comment">     * slot. If the node overflows, then it must be split and the new split</span>
<a name="l02188"></a>02188 <span class="comment">     * node inserted into the parent. Unroll / this splitting up to the root.</span>
<a name="l02189"></a>02189 <span class="comment">    */</span>
<a name="l02190"></a><a class="code" href="a00001.html#a07898a6b8d2fcc51dc713c1096ce8fdf">02190</a>     std::pair&lt;iterator, bool&gt; <a class="code" href="a00001.html#a07898a6b8d2fcc51dc713c1096ce8fdf" title="Insert an item into the B+ tree.">insert_descend</a>(node* n,
<a name="l02191"></a>02191                                              <span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key, <span class="keyword">const</span> <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">data_type</a>&amp; value,
<a name="l02192"></a>02192                                              <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>* splitkey, node** splitnode)
<a name="l02193"></a>02193     {
<a name="l02194"></a>02194         <span class="keywordflow">if</span> (!n-&gt;isleafnode())
<a name="l02195"></a>02195         {
<a name="l02196"></a>02196             inner_node *inner = <span class="keyword">static_cast&lt;</span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l02197"></a>02197 
<a name="l02198"></a>02198             <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> newkey = <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>();
<a name="l02199"></a>02199             node *newchild = NULL;
<a name="l02200"></a>02200 
<a name="l02201"></a>02201             <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(inner, key);
<a name="l02202"></a>02202 
<a name="l02203"></a>02203             <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::insert_descend into &quot;</span> &lt;&lt; inner-&gt;childid[slot]);
<a name="l02204"></a>02204 
<a name="l02205"></a>02205             std::pair&lt;iterator, bool&gt; r = <a class="code" href="a00001.html#a07898a6b8d2fcc51dc713c1096ce8fdf" title="Insert an item into the B+ tree.">insert_descend</a>(inner-&gt;childid[slot],
<a name="l02206"></a>02206                                                          key, value, &amp;newkey, &amp;newchild);
<a name="l02207"></a>02207 
<a name="l02208"></a>02208             <span class="keywordflow">if</span> (newchild)
<a name="l02209"></a>02209             {
<a name="l02210"></a>02210                 <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::insert_descend newchild with key &quot;</span> &lt;&lt; newkey &lt;&lt; <span class="stringliteral">&quot; node &quot;</span> &lt;&lt; newchild &lt;&lt; <span class="stringliteral">&quot; at slot &quot;</span> &lt;&lt; slot);
<a name="l02211"></a>02211 
<a name="l02212"></a>02212                 <span class="keywordflow">if</span> (inner-&gt;isfull())
<a name="l02213"></a>02213                 {
<a name="l02214"></a>02214                     <a class="code" href="a00001.html#a5716fa91bd7418aed6dd62c33392e479" title="Split up an inner node into two equally-filled sibling nodes.">split_inner_node</a>(inner, splitkey, splitnode, slot);
<a name="l02215"></a>02215 
<a name="l02216"></a>02216                     <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::insert_descend done split_inner: putslot: &quot;</span> &lt;&lt; slot &lt;&lt; <span class="stringliteral">&quot; putkey: &quot;</span> &lt;&lt; newkey &lt;&lt; <span class="stringliteral">&quot; upkey: &quot;</span> &lt;&lt; *splitkey);
<a name="l02217"></a>02217 
<a name="l02218"></a>02218 <span class="preprocessor">#ifdef BTREE_DEBUG</span>
<a name="l02219"></a>02219 <span class="preprocessor"></span>                    <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a224f31a88d50490e14f0f291d70ef2fc" title="Debug parameter: Prints out lots of debug information about how the algorithms change the tree...">debug</a>)
<a name="l02220"></a>02220                     {
<a name="l02221"></a>02221                         <a class="code" href="a00001.html#a7a031022658d93a4d7d92522947816b4" title="Recursively descend down the tree and print out nodes.">print_node</a>(std::cout, inner);
<a name="l02222"></a>02222                         <a class="code" href="a00001.html#a7a031022658d93a4d7d92522947816b4" title="Recursively descend down the tree and print out nodes.">print_node</a>(std::cout, *splitnode);
<a name="l02223"></a>02223                     }
<a name="l02224"></a>02224 <span class="preprocessor">#endif</span>
<a name="l02225"></a>02225 <span class="preprocessor"></span>
<a name="l02226"></a>02226                     <span class="comment">// check if insert slot is in the split sibling node</span>
<a name="l02227"></a>02227                     <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::insert_descend switch: &quot;</span> &lt;&lt; slot &lt;&lt; <span class="stringliteral">&quot; &gt; &quot;</span> &lt;&lt; inner-&gt;slotuse+1);
<a name="l02228"></a>02228 
<a name="l02229"></a>02229                     <span class="keywordflow">if</span> (slot == inner-&gt;slotuse+1 &amp;&amp; inner-&gt;slotuse &lt; (*splitnode)-&gt;slotuse)
<a name="l02230"></a>02230                     {
<a name="l02231"></a>02231                         <span class="comment">// special case when the insert slot matches the split</span>
<a name="l02232"></a>02232                         <span class="comment">// place between the two nodes, then the insert key</span>
<a name="l02233"></a>02233                         <span class="comment">// becomes the split key.</span>
<a name="l02234"></a>02234 
<a name="l02235"></a>02235                         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(inner-&gt;slotuse + 1 &lt; <a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">innerslotmax</a>);
<a name="l02236"></a>02236 
<a name="l02237"></a>02237                         inner_node *splitinner = <span class="keyword">static_cast&lt;</span>inner_node*<span class="keyword">&gt;</span>(*splitnode);
<a name="l02238"></a>02238 
<a name="l02239"></a>02239                         <span class="comment">// move the split key and it&#39;s datum into the left node</span>
<a name="l02240"></a>02240                         inner-&gt;slotkey[inner-&gt;slotuse] = *splitkey;
<a name="l02241"></a>02241                         inner-&gt;childid[inner-&gt;slotuse+1] = splitinner-&gt;childid[0];
<a name="l02242"></a>02242                         inner-&gt;slotuse++;
<a name="l02243"></a>02243 
<a name="l02244"></a>02244                         <span class="comment">// set new split key and move corresponding datum into right node</span>
<a name="l02245"></a>02245                         splitinner-&gt;childid[0] = newchild;
<a name="l02246"></a>02246                         *splitkey = newkey;
<a name="l02247"></a>02247 
<a name="l02248"></a>02248                         <span class="keywordflow">return</span> r;
<a name="l02249"></a>02249                     }
<a name="l02250"></a>02250                     <span class="keywordflow">else</span> <span class="keywordflow">if</span> (slot &gt;= inner-&gt;slotuse+1)
<a name="l02251"></a>02251                     {
<a name="l02252"></a>02252                         <span class="comment">// in case the insert slot is in the newly create split</span>
<a name="l02253"></a>02253                         <span class="comment">// node, we reuse the code below.</span>
<a name="l02254"></a>02254 
<a name="l02255"></a>02255                         slot -= inner-&gt;slotuse+1;
<a name="l02256"></a>02256                         inner = <span class="keyword">static_cast&lt;</span>inner_node*<span class="keyword">&gt;</span>(*splitnode);
<a name="l02257"></a>02257                         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::insert_descend switching to splitted node &quot;</span> &lt;&lt; inner &lt;&lt; <span class="stringliteral">&quot; slot &quot;</span> &lt;&lt; slot);
<a name="l02258"></a>02258                     }
<a name="l02259"></a>02259                 }
<a name="l02260"></a>02260 
<a name="l02261"></a>02261                 <span class="comment">// move items and put pointer to child node into correct slot</span>
<a name="l02262"></a>02262                 <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(slot &gt;= 0 &amp;&amp; slot &lt;= inner-&gt;slotuse);
<a name="l02263"></a>02263 
<a name="l02264"></a>02264                 std::copy_backward(inner-&gt;slotkey + slot, inner-&gt;slotkey + inner-&gt;slotuse,
<a name="l02265"></a>02265                                    inner-&gt;slotkey + inner-&gt;slotuse+1);
<a name="l02266"></a>02266                 std::copy_backward(inner-&gt;childid + slot, inner-&gt;childid + inner-&gt;slotuse+1,
<a name="l02267"></a>02267                                    inner-&gt;childid + inner-&gt;slotuse+2);
<a name="l02268"></a>02268 
<a name="l02269"></a>02269                 inner-&gt;slotkey[slot] = newkey;
<a name="l02270"></a>02270                 inner-&gt;childid[slot + 1] = newchild;
<a name="l02271"></a>02271                 inner-&gt;slotuse++;
<a name="l02272"></a>02272             }
<a name="l02273"></a>02273 
<a name="l02274"></a>02274             <span class="keywordflow">return</span> r;
<a name="l02275"></a>02275         }
<a name="l02276"></a>02276         <span class="keywordflow">else</span> <span class="comment">// n-&gt;isleafnode() == true</span>
<a name="l02277"></a>02277         {
<a name="l02278"></a>02278             leaf_node *leaf = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l02279"></a>02279 
<a name="l02280"></a>02280             <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(leaf, key);
<a name="l02281"></a>02281 
<a name="l02282"></a>02282             <span class="keywordflow">if</span> (!<a class="code" href="a00001.html#acd41575a35d1c5d55e955aafc9762454" title="Sixth template parameter: Allow duplicate keys in the B+ tree.">allow_duplicates</a> &amp;&amp; slot &lt; leaf-&gt;slotuse &amp;&amp; <a class="code" href="a00001.html#ac3b0c8e750101dfad0ef70c54532dd68" title="True if a == b ? constructed from key_less().">key_equal</a>(key, leaf-&gt;slotkey[slot])) {
<a name="l02283"></a>02283                 <span class="keywordflow">return</span> std::pair&lt;iterator, bool&gt;(iterator(leaf, slot), <span class="keyword">false</span>);
<a name="l02284"></a>02284             }
<a name="l02285"></a>02285 
<a name="l02286"></a>02286             <span class="keywordflow">if</span> (leaf-&gt;isfull())
<a name="l02287"></a>02287             {
<a name="l02288"></a>02288                 <a class="code" href="a00001.html#ac82d4e07a4397d91c9fb5b124d229fb0" title="Split up a leaf node into two equally-filled sibling leaves.">split_leaf_node</a>(leaf, splitkey, splitnode);
<a name="l02289"></a>02289 
<a name="l02290"></a>02290                 <span class="comment">// check if insert slot is in the split sibling node</span>
<a name="l02291"></a>02291                 <span class="keywordflow">if</span> (slot &gt;= leaf-&gt;slotuse)
<a name="l02292"></a>02292                 {
<a name="l02293"></a>02293                     slot -= leaf-&gt;slotuse;
<a name="l02294"></a>02294                     leaf = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(*splitnode);
<a name="l02295"></a>02295                 }
<a name="l02296"></a>02296             }
<a name="l02297"></a>02297 
<a name="l02298"></a>02298             <span class="comment">// move items and put data item into correct data slot</span>
<a name="l02299"></a>02299             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(slot &gt;= 0 &amp;&amp; slot &lt;= leaf-&gt;slotuse);
<a name="l02300"></a>02300 
<a name="l02301"></a>02301             std::copy_backward(leaf-&gt;slotkey + slot, leaf-&gt;slotkey + leaf-&gt;slotuse,
<a name="l02302"></a>02302                                leaf-&gt;slotkey + leaf-&gt;slotuse+1);
<a name="l02303"></a>02303             <a class="code" href="a00001.html#a555a24bfd925a5d77bba28041d207f8d" title="Convenient template function for conditional copying of slotdata.">data_copy_backward</a>(leaf-&gt;slotdata + slot, leaf-&gt;slotdata + leaf-&gt;slotuse,
<a name="l02304"></a>02304                                leaf-&gt;slotdata + leaf-&gt;slotuse+1);
<a name="l02305"></a>02305 
<a name="l02306"></a>02306             leaf-&gt;slotkey[slot] = key;
<a name="l02307"></a>02307             <span class="keywordflow">if</span> (!<a class="code" href="a00001.html#a636973c0a66512d36c7aa833435ad023" title="Eighth template parameter: boolean indicator whether the btree is used as a set.">used_as_set</a>) leaf-&gt;slotdata[slot] = value;
<a name="l02308"></a>02308             leaf-&gt;slotuse++;
<a name="l02309"></a>02309 
<a name="l02310"></a>02310             <span class="keywordflow">if</span> (splitnode &amp;&amp; leaf != *splitnode &amp;&amp; slot == leaf-&gt;slotuse-1)
<a name="l02311"></a>02311             {
<a name="l02312"></a>02312                 <span class="comment">// special case: the node was split, and the insert is at the</span>
<a name="l02313"></a>02313                 <span class="comment">// last slot of the old node. then the splitkey must be</span>
<a name="l02314"></a>02314                 <span class="comment">// updated.</span>
<a name="l02315"></a>02315                 *splitkey = key;
<a name="l02316"></a>02316             }
<a name="l02317"></a>02317 
<a name="l02318"></a>02318             <span class="keywordflow">return</span> std::pair&lt;iterator, bool&gt;(iterator(leaf, slot), <span class="keyword">true</span>);
<a name="l02319"></a>02319         }
<a name="l02320"></a>02320     }
<a name="l02321"></a>02321 <span class="comment"></span>
<a name="l02322"></a>02322 <span class="comment">    /// Split up a leaf node into two equally-filled sibling leaves. Returns</span>
<a name="l02323"></a>02323 <span class="comment">    /// the new nodes and it&#39;s insertion key in the two parameters.</span>
<a name="l02324"></a><a class="code" href="a00001.html#ac82d4e07a4397d91c9fb5b124d229fb0">02324</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#ac82d4e07a4397d91c9fb5b124d229fb0" title="Split up a leaf node into two equally-filled sibling leaves.">split_leaf_node</a>(leaf_node* leaf, <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>* _newkey, node** _newleaf)
<a name="l02325"></a>02325     {
<a name="l02326"></a>02326         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leaf-&gt;isfull());
<a name="l02327"></a>02327 
<a name="l02328"></a>02328         <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> mid = (leaf-&gt;slotuse &gt;&gt; 1);
<a name="l02329"></a>02329 
<a name="l02330"></a>02330         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::split_leaf_node on &quot;</span> &lt;&lt; leaf);
<a name="l02331"></a>02331 
<a name="l02332"></a>02332         leaf_node *newleaf = <a class="code" href="a00001.html#ab6ff4b0f13f48e417a45431318a00337" title="Allocate and initialize a leaf node.">allocate_leaf</a>();
<a name="l02333"></a>02333 
<a name="l02334"></a>02334         newleaf-&gt;slotuse = leaf-&gt;slotuse - mid;
<a name="l02335"></a>02335 
<a name="l02336"></a>02336         newleaf-&gt;nextleaf = leaf-&gt;nextleaf;
<a name="l02337"></a>02337         <span class="keywordflow">if</span> (newleaf-&gt;nextleaf == NULL) {
<a name="l02338"></a>02338             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leaf == <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>);
<a name="l02339"></a>02339             <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> = newleaf;
<a name="l02340"></a>02340         }
<a name="l02341"></a>02341         <span class="keywordflow">else</span> {
<a name="l02342"></a>02342             newleaf-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a>-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> = newleaf;
<a name="l02343"></a>02343         }
<a name="l02344"></a>02344 
<a name="l02345"></a>02345         std::copy(leaf-&gt;slotkey + mid, leaf-&gt;slotkey + leaf-&gt;slotuse,
<a name="l02346"></a>02346                   newleaf-&gt;slotkey);
<a name="l02347"></a>02347         <a class="code" href="a00001.html#ad8a89e088fbfedec4218ea46f8899941" title="Convenient template function for conditional copying of slotdata.">data_copy</a>(leaf-&gt;slotdata + mid, leaf-&gt;slotdata + leaf-&gt;slotuse,
<a name="l02348"></a>02348                   newleaf-&gt;slotdata);
<a name="l02349"></a>02349 
<a name="l02350"></a>02350         leaf-&gt;slotuse = mid;
<a name="l02351"></a>02351         leaf-&gt;nextleaf = newleaf;
<a name="l02352"></a>02352         newleaf-&gt;prevleaf = leaf;
<a name="l02353"></a>02353 
<a name="l02354"></a>02354         *_newkey = leaf-&gt;slotkey[leaf-&gt;slotuse-1];
<a name="l02355"></a>02355         *_newleaf = newleaf;
<a name="l02356"></a>02356     }
<a name="l02357"></a>02357 <span class="comment"></span>
<a name="l02358"></a>02358 <span class="comment">    /// Split up an inner node into two equally-filled sibling nodes. Returns</span>
<a name="l02359"></a>02359 <span class="comment">    /// the new nodes and it&#39;s insertion key in the two parameters. Requires</span>
<a name="l02360"></a>02360 <span class="comment">    /// the slot of the item will be inserted, so the nodes will be the same</span>
<a name="l02361"></a>02361 <span class="comment">    /// size after the insert.</span>
<a name="l02362"></a><a class="code" href="a00001.html#a5716fa91bd7418aed6dd62c33392e479">02362</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#a5716fa91bd7418aed6dd62c33392e479" title="Split up an inner node into two equally-filled sibling nodes.">split_inner_node</a>(inner_node* inner, <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>* _newkey, node** _newinner, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> addslot)
<a name="l02363"></a>02363     {
<a name="l02364"></a>02364         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(inner-&gt;isfull());
<a name="l02365"></a>02365 
<a name="l02366"></a>02366         <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> mid = (inner-&gt;slotuse &gt;&gt; 1);
<a name="l02367"></a>02367 
<a name="l02368"></a>02368         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::split_inner: mid &quot;</span> &lt;&lt; mid &lt;&lt; <span class="stringliteral">&quot; addslot &quot;</span> &lt;&lt; addslot);
<a name="l02369"></a>02369 
<a name="l02370"></a>02370         <span class="comment">// if the split is uneven and the overflowing item will be put into the</span>
<a name="l02371"></a>02371         <span class="comment">// larger node, then the smaller split node may underflow</span>
<a name="l02372"></a>02372         <span class="keywordflow">if</span> (addslot &lt;= mid &amp;&amp; mid &gt; inner-&gt;slotuse - (mid + 1))
<a name="l02373"></a>02373             mid--;
<a name="l02374"></a>02374 
<a name="l02375"></a>02375         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::split_inner: mid &quot;</span> &lt;&lt; mid &lt;&lt; <span class="stringliteral">&quot; addslot &quot;</span> &lt;&lt; addslot);
<a name="l02376"></a>02376 
<a name="l02377"></a>02377         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::split_inner_node on &quot;</span> &lt;&lt; inner &lt;&lt; <span class="stringliteral">&quot; into two nodes &quot;</span> &lt;&lt; mid &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; inner-&gt;slotuse - (mid + 1) &lt;&lt; <span class="stringliteral">&quot; sized&quot;</span>);
<a name="l02378"></a>02378 
<a name="l02379"></a>02379         inner_node *newinner = <a class="code" href="a00001.html#a1bf04093f2dc2a1cb57955ff55d3762a" title="Allocate and initialize an inner node.">allocate_inner</a>(inner-&gt;level);
<a name="l02380"></a>02380 
<a name="l02381"></a>02381         newinner-&gt;slotuse = inner-&gt;slotuse - (mid + 1);
<a name="l02382"></a>02382 
<a name="l02383"></a>02383         std::copy(inner-&gt;slotkey + mid+1, inner-&gt;slotkey + inner-&gt;slotuse,
<a name="l02384"></a>02384                   newinner-&gt;slotkey);
<a name="l02385"></a>02385         std::copy(inner-&gt;childid + mid+1, inner-&gt;childid + inner-&gt;slotuse+1,
<a name="l02386"></a>02386                   newinner-&gt;childid);
<a name="l02387"></a>02387 
<a name="l02388"></a>02388         inner-&gt;slotuse = mid;
<a name="l02389"></a>02389 
<a name="l02390"></a>02390         *_newkey = inner-&gt;slotkey[mid];
<a name="l02391"></a>02391         *_newinner = newinner;
<a name="l02392"></a>02392     }
<a name="l02393"></a>02393 
<a name="l02394"></a>02394 <span class="keyword">public</span>:
<a name="l02395"></a>02395 
<a name="l02396"></a>02396     <span class="comment">// *** Bulk Loader - Construct Tree from Sorted Sequence</span>
<a name="l02397"></a>02397 <span class="comment"></span>
<a name="l02398"></a>02398 <span class="comment">    /// Bulk load a sorted range. Loads items into leaves and constructs a</span>
<a name="l02399"></a>02399 <span class="comment">    /// B-tree above them. The tree must be empty when calling this function.</span>
<a name="l02400"></a>02400 <span class="comment"></span>    <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Iterator&gt;
<a name="l02401"></a><a class="code" href="a00001.html#a053c808858d78e6f0a93041ab612d656">02401</a>     <span class="keywordtype">void</span> <a class="code" href="a00001.html#a053c808858d78e6f0a93041ab612d656" title="Bulk load a sorted range.">bulk_load</a>(Iterator ibegin, Iterator iend)
<a name="l02402"></a>02402     {
<a name="l02403"></a>02403         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00001.html#ad7cf0c4833d2ea3fcd79df4c884bab40" title="Returns true if there is at least one key/data pair in the B+ tree.">empty</a>());
<a name="l02404"></a>02404 
<a name="l02405"></a>02405         <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a> = iend - ibegin;
<a name="l02406"></a>02406 
<a name="l02407"></a>02407         <span class="comment">// calculate number of leaves needed, round up.</span>
<a name="l02408"></a>02408         <span class="keywordtype">size_t</span> num_items = iend - ibegin;
<a name="l02409"></a>02409         <span class="keywordtype">size_t</span> num_leaves = (num_items + <a class="code" href="a00001.html#ac6c274f39fce8e14f6a881fc1da39cf8" title="Base B+ tree parameter: The number of key/data slots in each leaf.">leafslotmax</a>-1) / <a class="code" href="a00001.html#ac6c274f39fce8e14f6a881fc1da39cf8" title="Base B+ tree parameter: The number of key/data slots in each leaf.">leafslotmax</a>;
<a name="l02410"></a>02410 
<a name="l02411"></a>02411         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::bulk_load, level 0: &quot;</span> &lt;&lt; <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a> &lt;&lt; <span class="stringliteral">&quot; items into &quot;</span> &lt;&lt; num_leaves &lt;&lt; <span class="stringliteral">&quot; leaves with up to &quot;</span> &lt;&lt; ((iend - ibegin + num_leaves-1) / num_leaves) &lt;&lt; <span class="stringliteral">&quot; items per leaf.&quot;</span>);
<a name="l02412"></a>02412 
<a name="l02413"></a>02413         Iterator it = ibegin;
<a name="l02414"></a>02414         <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; num_leaves; ++i)
<a name="l02415"></a>02415         {
<a name="l02416"></a>02416             <span class="comment">// allocate new leaf node</span>
<a name="l02417"></a>02417             leaf_node* leaf = <a class="code" href="a00001.html#ab6ff4b0f13f48e417a45431318a00337" title="Allocate and initialize a leaf node.">allocate_leaf</a>();
<a name="l02418"></a>02418 
<a name="l02419"></a>02419             <span class="comment">// copy keys or (key,value) pairs into leaf nodes, uses template</span>
<a name="l02420"></a>02420             <span class="comment">// switch leaf-&gt;set_slot().</span>
<a name="l02421"></a>02421             leaf-&gt;slotuse = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(num_items / (num_leaves-i));
<a name="l02422"></a>02422             <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> s = 0; s &lt; leaf-&gt;slotuse; ++s, ++it)
<a name="l02423"></a>02423                 leaf-&gt;set_slot(s, *it);
<a name="l02424"></a>02424 
<a name="l02425"></a>02425             <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> != NULL) {
<a name="l02426"></a>02426                 <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a> = leaf;
<a name="l02427"></a>02427                 leaf-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> = <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>;
<a name="l02428"></a>02428             }
<a name="l02429"></a>02429             <span class="keywordflow">else</span> {
<a name="l02430"></a>02430                 <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a> = leaf;
<a name="l02431"></a>02431             }
<a name="l02432"></a>02432             <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> = leaf;
<a name="l02433"></a>02433 
<a name="l02434"></a>02434             num_items -= leaf-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a>;
<a name="l02435"></a>02435         }
<a name="l02436"></a>02436 
<a name="l02437"></a>02437         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>( it == iend &amp;&amp; num_items == 0 );
<a name="l02438"></a>02438 
<a name="l02439"></a>02439         <span class="comment">// if the btree is so small to fit into one leaf, then we&#39;re done.</span>
<a name="l02440"></a>02440         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a> == <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>) {
<a name="l02441"></a>02441             <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> = <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>;
<a name="l02442"></a>02442             <span class="keywordflow">return</span>;
<a name="l02443"></a>02443         }
<a name="l02444"></a>02444 
<a name="l02445"></a>02445         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>( <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#aa4d4f72b9a8f7a58424063aa1d4a1fcc" title="Number of leaves in the B+ tree.">leaves</a> == num_leaves );
<a name="l02446"></a>02446 
<a name="l02447"></a>02447         <span class="comment">// create first level of inner nodes, pointing to the leaves.</span>
<a name="l02448"></a>02448         <span class="keywordtype">size_t</span> num_parents = (num_leaves + (<a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">innerslotmax</a>+1)-1) / (<a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">innerslotmax</a>+1);
<a name="l02449"></a>02449 
<a name="l02450"></a>02450         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::bulk_load, level 1: &quot;</span> &lt;&lt; num_leaves &lt;&lt; <span class="stringliteral">&quot; leaves in &quot;</span> &lt;&lt; num_parents &lt;&lt; <span class="stringliteral">&quot; inner nodes with up to &quot;</span> &lt;&lt; ((num_leaves + num_parents-1) / num_parents) &lt;&lt; <span class="stringliteral">&quot; leaves per inner node.&quot;</span>);
<a name="l02451"></a>02451 
<a name="l02452"></a>02452         <span class="comment">// save inner nodes and maxkey for next level.</span>
<a name="l02453"></a>02453         <span class="keyword">typedef</span> std::pair&lt;inner_node*, const key_type*&gt; nextlevel_type;
<a name="l02454"></a>02454         nextlevel_type* nextlevel = <span class="keyword">new</span> nextlevel_type[num_parents];
<a name="l02455"></a>02455 
<a name="l02456"></a>02456         leaf_node* leaf = <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>;
<a name="l02457"></a>02457         <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; num_parents; ++i)
<a name="l02458"></a>02458         {
<a name="l02459"></a>02459             <span class="comment">// allocate new inner node at level 1</span>
<a name="l02460"></a>02460             inner_node* n = <a class="code" href="a00001.html#a1bf04093f2dc2a1cb57955ff55d3762a" title="Allocate and initialize an inner node.">allocate_inner</a>(1);
<a name="l02461"></a>02461 
<a name="l02462"></a>02462             n-&gt;slotuse = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(num_leaves / (num_parents-i));
<a name="l02463"></a>02463             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(n-&gt;slotuse &gt; 0);
<a name="l02464"></a>02464             --n-&gt;slotuse; <span class="comment">// this counts keys, but an inner node has keys+1 children.</span>
<a name="l02465"></a>02465 
<a name="l02466"></a>02466             <span class="comment">// copy last key from each leaf and set child</span>
<a name="l02467"></a>02467             <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> s = 0; s &lt; n-&gt;slotuse; ++s)
<a name="l02468"></a>02468             {
<a name="l02469"></a>02469                 n-&gt;slotkey[s] = leaf-&gt;slotkey[leaf-&gt;slotuse-1];
<a name="l02470"></a>02470                 n-&gt;childid[s] = leaf;
<a name="l02471"></a>02471                 leaf = leaf-&gt;nextleaf;
<a name="l02472"></a>02472             }
<a name="l02473"></a>02473             n-&gt;childid[n-&gt;slotuse] = leaf;
<a name="l02474"></a>02474 
<a name="l02475"></a>02475             <span class="comment">// track max key of any descendant.</span>
<a name="l02476"></a>02476             nextlevel[i].first = n;
<a name="l02477"></a>02477             nextlevel[i].second = &amp;leaf-&gt;slotkey[leaf-&gt;slotuse-1];
<a name="l02478"></a>02478 
<a name="l02479"></a>02479             leaf = leaf-&gt;nextleaf;
<a name="l02480"></a>02480             num_leaves -= n-&gt;slotuse+1;
<a name="l02481"></a>02481         }
<a name="l02482"></a>02482 
<a name="l02483"></a>02483         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>( leaf == NULL &amp;&amp; num_leaves == 0 );
<a name="l02484"></a>02484 
<a name="l02485"></a>02485         <span class="comment">// recursively build inner nodes pointing to inner nodes.</span>
<a name="l02486"></a>02486         <span class="keywordflow">for</span> (<span class="keywordtype">int</span> level = 2; num_parents != 1; ++level)
<a name="l02487"></a>02487         {
<a name="l02488"></a>02488             <span class="keywordtype">size_t</span> num_children = num_parents;
<a name="l02489"></a>02489             num_parents = (num_children + (<a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">innerslotmax</a>+1)-1) / (<a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">innerslotmax</a>+1);
<a name="l02490"></a>02490 
<a name="l02491"></a>02491             <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::bulk_load, level &quot;</span> &lt;&lt; level &lt;&lt; <span class="stringliteral">&quot;: &quot;</span> &lt;&lt; num_children &lt;&lt; <span class="stringliteral">&quot; children in &quot;</span> &lt;&lt; num_parents &lt;&lt; <span class="stringliteral">&quot; inner nodes with up to &quot;</span> &lt;&lt; ((num_children + num_parents-1) / num_parents) &lt;&lt; <span class="stringliteral">&quot; children per inner node.&quot;</span>);
<a name="l02492"></a>02492 
<a name="l02493"></a>02493             <span class="keywordtype">size_t</span> inner_index = 0;
<a name="l02494"></a>02494             <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i &lt; num_parents; ++i)
<a name="l02495"></a>02495             {
<a name="l02496"></a>02496                 <span class="comment">// allocate new inner node at level</span>
<a name="l02497"></a>02497                 inner_node* n = <a class="code" href="a00001.html#a1bf04093f2dc2a1cb57955ff55d3762a" title="Allocate and initialize an inner node.">allocate_inner</a>(level);
<a name="l02498"></a>02498 
<a name="l02499"></a>02499                 n-&gt;slotuse = <span class="keyword">static_cast&lt;</span><span class="keywordtype">int</span><span class="keyword">&gt;</span>(num_children / (num_parents-i));
<a name="l02500"></a>02500                 <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(n-&gt;slotuse &gt; 0);
<a name="l02501"></a>02501                 --n-&gt;slotuse; <span class="comment">// this counts keys, but an inner node has keys+1 children.</span>
<a name="l02502"></a>02502 
<a name="l02503"></a>02503                 <span class="comment">// copy children and maxkeys from nextlevel</span>
<a name="l02504"></a>02504                 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> s = 0; s &lt; n-&gt;slotuse; ++s)
<a name="l02505"></a>02505                 {
<a name="l02506"></a>02506                     n-&gt;slotkey[s] = *nextlevel[inner_index].second;
<a name="l02507"></a>02507                     n-&gt;childid[s] = nextlevel[inner_index].first;
<a name="l02508"></a>02508                     ++inner_index;
<a name="l02509"></a>02509                 }
<a name="l02510"></a>02510                 n-&gt;childid[n-&gt;slotuse] = nextlevel[inner_index].first;
<a name="l02511"></a>02511 
<a name="l02512"></a>02512                 <span class="comment">// reuse nextlevel array for parents, because we can overwrite</span>
<a name="l02513"></a>02513                 <span class="comment">// slots we&#39;ve already consumed.</span>
<a name="l02514"></a>02514                 nextlevel[i].first = n;
<a name="l02515"></a>02515                 nextlevel[i].second = nextlevel[inner_index].second;
<a name="l02516"></a>02516 
<a name="l02517"></a>02517                 ++inner_index;
<a name="l02518"></a>02518                 num_children -= n-&gt;slotuse+1;
<a name="l02519"></a>02519             }
<a name="l02520"></a>02520 
<a name="l02521"></a>02521             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>( num_children == 0 );
<a name="l02522"></a>02522         }
<a name="l02523"></a>02523 
<a name="l02524"></a>02524         <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> = nextlevel[0].first;
<a name="l02525"></a>02525         <span class="keyword">delete</span> [] nextlevel;
<a name="l02526"></a>02526 
<a name="l02527"></a>02527         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>) <a class="code" href="a00001.html#ad7008114b409fe53a5739a69f3b90e59" title="Run a thorough verification of all B+ tree invariants.">verify</a>();
<a name="l02528"></a>02528     }
<a name="l02529"></a>02529 
<a name="l02530"></a>02530 <span class="keyword">private</span>:
<a name="l02531"></a>02531     <span class="comment">// *** Support Class Encapsulating Deletion Results</span>
<a name="l02532"></a>02532 <span class="comment"></span>
<a name="l02533"></a>02533 <span class="comment">    /// Result flags of recursive deletion.</span>
<a name="l02534"></a><a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02b">02534</a> <span class="comment"></span>    <span class="keyword">enum</span> <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02b" title="Result flags of recursive deletion.">result_flags_t</a>
<a name="l02535"></a>02535     {<span class="comment"></span>
<a name="l02536"></a>02536 <span class="comment">        /// Deletion successful and no fix-ups necessary.</span>
<a name="l02537"></a><a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02bae9409a8c5c6d8b59e3fd6a70e1106d88">02537</a> <span class="comment"></span>        <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02bae9409a8c5c6d8b59e3fd6a70e1106d88" title="Deletion successful and no fix-ups necessary.">btree_ok</a> = 0,
<a name="l02538"></a>02538 <span class="comment"></span>
<a name="l02539"></a>02539 <span class="comment">        /// Deletion not successful because key was not found.</span>
<a name="l02540"></a><a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba9c5aae923574ee89980049e9088f943e">02540</a> <span class="comment"></span>        <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba9c5aae923574ee89980049e9088f943e" title="Deletion not successful because key was not found.">btree_not_found</a> = 1,
<a name="l02541"></a>02541 <span class="comment"></span>
<a name="l02542"></a>02542 <span class="comment">        /// Deletion successful, the last key was updated so parent slotkeys</span>
<a name="l02543"></a>02543 <span class="comment">        /// need updates.</span>
<a name="l02544"></a><a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba7e66903441bb2c3c8164040f9efea0d8">02544</a> <span class="comment"></span>        <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba7e66903441bb2c3c8164040f9efea0d8" title="Deletion successful, the last key was updated so parent slotkeys need updates.">btree_update_lastkey</a> = 2,
<a name="l02545"></a>02545 <span class="comment"></span>
<a name="l02546"></a>02546 <span class="comment">        /// Deletion successful, children nodes were merged and the parent</span>
<a name="l02547"></a>02547 <span class="comment">        /// needs to remove the empty node.</span>
<a name="l02548"></a><a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba22159386e444003f86027c412d28ef43">02548</a> <span class="comment"></span>        <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba22159386e444003f86027c412d28ef43" title="Deletion successful, children nodes were merged and the parent needs to remove the empty node...">btree_fixmerge</a> = 4
<a name="l02549"></a>02549     };
<a name="l02550"></a>02550 <span class="comment"></span>
<a name="l02551"></a>02551 <span class="comment">    /// B+ tree recursive deletion has much information which is needs to be</span>
<a name="l02552"></a>02552 <span class="comment">    /// passed upward.</span>
<a name="l02553"></a><a class="code" href="a00019.html">02553</a> <span class="comment"></span>    <span class="keyword">struct </span><a class="code" href="a00019.html" title="B+ tree recursive deletion has much information which is needs to be passed upward.">result_t</a>
<a name="l02554"></a>02554     {<span class="comment"></span>
<a name="l02555"></a>02555 <span class="comment">        /// Merged result flags</span>
<a name="l02556"></a><a class="code" href="a00019.html#a6e044b06d9dce43b0f0d43d64ef30b38">02556</a> <span class="comment"></span>        <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02b" title="Result flags of recursive deletion.">result_flags_t</a>  <a class="code" href="a00019.html#a6e044b06d9dce43b0f0d43d64ef30b38" title="Merged result flags.">flags</a>;
<a name="l02557"></a>02557 <span class="comment"></span>
<a name="l02558"></a>02558 <span class="comment">        /// The key to be updated at the parent&#39;s slot</span>
<a name="l02559"></a><a class="code" href="a00019.html#a3f991156f89e99cd9143bfa816da4e92">02559</a> <span class="comment"></span>        <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>        <a class="code" href="a00019.html#a3f991156f89e99cd9143bfa816da4e92" title="The key to be updated at the parent&#39;s slot.">lastkey</a>;
<a name="l02560"></a>02560 <span class="comment"></span>
<a name="l02561"></a>02561 <span class="comment">        /// Constructor of a result with a specific flag, this can also be used</span>
<a name="l02562"></a>02562 <span class="comment">        /// as for implicit conversion.</span>
<a name="l02563"></a><a class="code" href="a00019.html#ad5027e43a6bfd8592c2cb0102d7841d6">02563</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00019.html#ad5027e43a6bfd8592c2cb0102d7841d6" title="Constructor of a result with a specific flag, this can also be used as for implicit conversion...">result_t</a>(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02b" title="Result flags of recursive deletion.">result_flags_t</a> f = <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02bae9409a8c5c6d8b59e3fd6a70e1106d88" title="Deletion successful and no fix-ups necessary.">btree_ok</a>)
<a name="l02564"></a>02564             : <a class="code" href="a00019.html#a6e044b06d9dce43b0f0d43d64ef30b38" title="Merged result flags.">flags</a>(f), <a class="code" href="a00019.html#a3f991156f89e99cd9143bfa816da4e92" title="The key to be updated at the parent&#39;s slot.">lastkey</a>()
<a name="l02565"></a>02565         { }
<a name="l02566"></a>02566 <span class="comment"></span>
<a name="l02567"></a>02567 <span class="comment">        /// Constructor with a lastkey value.</span>
<a name="l02568"></a><a class="code" href="a00019.html#a8ae54cfaafef34bbe21ccc21d37afe49">02568</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00019.html#ad5027e43a6bfd8592c2cb0102d7841d6" title="Constructor of a result with a specific flag, this can also be used as for implicit conversion...">result_t</a>(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02b" title="Result flags of recursive deletion.">result_flags_t</a> f, <span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;k)
<a name="l02569"></a>02569             : <a class="code" href="a00019.html#a6e044b06d9dce43b0f0d43d64ef30b38" title="Merged result flags.">flags</a>(f), <a class="code" href="a00019.html#a3f991156f89e99cd9143bfa816da4e92" title="The key to be updated at the parent&#39;s slot.">lastkey</a>(k)
<a name="l02570"></a>02570         { }
<a name="l02571"></a>02571 <span class="comment"></span>
<a name="l02572"></a>02572 <span class="comment">        /// Test if this result object has a given flag set.</span>
<a name="l02573"></a><a class="code" href="a00019.html#a636848529dcbaf2287bf0454d74d2043">02573</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00019.html#a636848529dcbaf2287bf0454d74d2043" title="Test if this result object has a given flag set.">has</a>(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02b" title="Result flags of recursive deletion.">result_flags_t</a> f)<span class="keyword"> const</span>
<a name="l02574"></a>02574 <span class="keyword">        </span>{
<a name="l02575"></a>02575             <span class="keywordflow">return</span> (<a class="code" href="a00019.html#a6e044b06d9dce43b0f0d43d64ef30b38" title="Merged result flags.">flags</a> &amp; f) != 0;
<a name="l02576"></a>02576         }
<a name="l02577"></a>02577 <span class="comment"></span>
<a name="l02578"></a>02578 <span class="comment">        /// Merge two results OR-ing the result flags and overwriting lastkeys.</span>
<a name="l02579"></a><a class="code" href="a00019.html#a95b7f90fd11bfc2cda0051f59c09e792">02579</a> <span class="comment"></span>        <span class="keyword">inline</span> <a class="code" href="a00019.html" title="B+ tree recursive deletion has much information which is needs to be passed upward.">result_t</a>&amp; <a class="code" href="a00019.html#a95b7f90fd11bfc2cda0051f59c09e792" title="Merge two results OR-ing the result flags and overwriting lastkeys.">operator|= </a>(<span class="keyword">const</span> <a class="code" href="a00019.html" title="B+ tree recursive deletion has much information which is needs to be passed upward.">result_t</a> &amp;other)
<a name="l02580"></a>02580         {
<a name="l02581"></a>02581             <a class="code" href="a00019.html#a6e044b06d9dce43b0f0d43d64ef30b38" title="Merged result flags.">flags</a> = <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02b" title="Result flags of recursive deletion.">result_flags_t</a>(<a class="code" href="a00019.html#a6e044b06d9dce43b0f0d43d64ef30b38" title="Merged result flags.">flags</a> | other.<a class="code" href="a00019.html#a6e044b06d9dce43b0f0d43d64ef30b38" title="Merged result flags.">flags</a>);
<a name="l02582"></a>02582 
<a name="l02583"></a>02583             <span class="comment">// we overwrite existing lastkeys on purpose</span>
<a name="l02584"></a>02584             <span class="keywordflow">if</span> (other.<a class="code" href="a00019.html#a636848529dcbaf2287bf0454d74d2043" title="Test if this result object has a given flag set.">has</a>(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba7e66903441bb2c3c8164040f9efea0d8" title="Deletion successful, the last key was updated so parent slotkeys need updates.">btree_update_lastkey</a>))
<a name="l02585"></a>02585                 <a class="code" href="a00019.html#a3f991156f89e99cd9143bfa816da4e92" title="The key to be updated at the parent&#39;s slot.">lastkey</a> = other.<a class="code" href="a00019.html#a3f991156f89e99cd9143bfa816da4e92" title="The key to be updated at the parent&#39;s slot.">lastkey</a>;
<a name="l02586"></a>02586 
<a name="l02587"></a>02587             <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l02588"></a>02588         }
<a name="l02589"></a>02589     };
<a name="l02590"></a>02590 
<a name="l02591"></a>02591 <span class="keyword">public</span>:
<a name="l02592"></a>02592     <span class="comment">// *** Public Erase Functions</span>
<a name="l02593"></a>02593 <span class="comment"></span>
<a name="l02594"></a>02594 <span class="comment">    /// Erases one (the first) of the key/data pairs associated with the given</span>
<a name="l02595"></a>02595 <span class="comment">    /// key.</span>
<a name="l02596"></a><a class="code" href="a00001.html#a07ca3a19f1e20908f7cca3180420c817">02596</a> <span class="comment"></span>    <span class="keywordtype">bool</span> <a class="code" href="a00001.html#a07ca3a19f1e20908f7cca3180420c817" title="Erases one (the first) of the key/data pairs associated with the given key.">erase_one</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;key)
<a name="l02597"></a>02597     {
<a name="l02598"></a>02598         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::erase_one(&quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot;) on btree size &quot;</span> &lt;&lt; <a class="code" href="a00001.html#a3942d7144bc93cf094b62f03e6113f4e" title="Return the number of key/data pairs in the B+ tree.">size</a>());
<a name="l02599"></a>02599 
<a name="l02600"></a>02600         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>) <a class="code" href="a00001.html#ad7008114b409fe53a5739a69f3b90e59" title="Run a thorough verification of all B+ tree invariants.">verify</a>();
<a name="l02601"></a>02601 
<a name="l02602"></a>02602         <span class="keywordflow">if</span> (!<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l02603"></a>02603 
<a name="l02604"></a>02604         result_t result = <a class="code" href="a00001.html#a141c007e7d7dce479b2797f3a0735d03" title="Erase one (the first) key/data pair in the B+ tree matching key.">erase_one_descend</a>(key, <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>, NULL, NULL, NULL, NULL, NULL, 0);
<a name="l02605"></a>02605 
<a name="l02606"></a>02606         <span class="keywordflow">if</span> (!result.has(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba9c5aae923574ee89980049e9088f943e" title="Deletion not successful because key was not found.">btree_not_found</a>))
<a name="l02607"></a>02607             --<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a>;
<a name="l02608"></a>02608 
<a name="l02609"></a>02609 #ifdef BTREE_DEBUG
<a name="l02610"></a>02610         if (<a class="code" href="a00001.html#a224f31a88d50490e14f0f291d70ef2fc" title="Debug parameter: Prints out lots of debug information about how the algorithms change the tree...">debug</a>) <a class="code" href="a00001.html#a29af931b81dc3446d1ffadab6fd5e017" title="Print out the B+ tree structure with keys onto the given ostream.">print</a>(std::cout);
<a name="l02611"></a>02611 <span class="preprocessor">#endif</span>
<a name="l02612"></a>02612 <span class="preprocessor"></span>        <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>) <a class="code" href="a00001.html#ad7008114b409fe53a5739a69f3b90e59" title="Run a thorough verification of all B+ tree invariants.">verify</a>();
<a name="l02613"></a>02613 
<a name="l02614"></a>02614         <span class="keywordflow">return</span> !result.has(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba9c5aae923574ee89980049e9088f943e" title="Deletion not successful because key was not found.">btree_not_found</a>);
<a name="l02615"></a>02615     }
<a name="l02616"></a>02616 <span class="comment"></span>
<a name="l02617"></a>02617 <span class="comment">    /// Erases all the key/data pairs associated with the given key. This is</span>
<a name="l02618"></a>02618 <span class="comment">    /// implemented using erase_one().</span>
<a name="l02619"></a><a class="code" href="a00001.html#a8bced926ecf575a393e06ca7d35291f1">02619</a> <span class="comment"></span>    <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a> <a class="code" href="a00001.html#a8bced926ecf575a393e06ca7d35291f1" title="Erases all the key/data pairs associated with the given key.">erase</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> &amp;key)
<a name="l02620"></a>02620     {
<a name="l02621"></a>02621         <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a> c = 0;
<a name="l02622"></a>02622 
<a name="l02623"></a>02623         <span class="keywordflow">while</span>( <a class="code" href="a00001.html#a07ca3a19f1e20908f7cca3180420c817" title="Erases one (the first) of the key/data pairs associated with the given key.">erase_one</a>(key) )
<a name="l02624"></a>02624         {
<a name="l02625"></a>02625             ++c;
<a name="l02626"></a>02626             <span class="keywordflow">if</span> (!<a class="code" href="a00001.html#acd41575a35d1c5d55e955aafc9762454" title="Sixth template parameter: Allow duplicate keys in the B+ tree.">allow_duplicates</a>) <span class="keywordflow">break</span>;
<a name="l02627"></a>02627         }
<a name="l02628"></a>02628 
<a name="l02629"></a>02629         <span class="keywordflow">return</span> c;
<a name="l02630"></a>02630     }
<a name="l02631"></a>02631 <span class="comment"></span>
<a name="l02632"></a>02632 <span class="comment">    /// Erase the key/data pair referenced by the iterator.</span>
<a name="l02633"></a><a class="code" href="a00001.html#a405c45adc3df9f58da98a785b65078a3">02633</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#a8bced926ecf575a393e06ca7d35291f1" title="Erases all the key/data pairs associated with the given key.">erase</a>(iterator iter)
<a name="l02634"></a>02634     {
<a name="l02635"></a>02635         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::erase_iter(&quot;</span> &lt;&lt; iter.currnode &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; iter.currslot &lt;&lt; <span class="stringliteral">&quot;) on btree size &quot;</span> &lt;&lt; <a class="code" href="a00001.html#a3942d7144bc93cf094b62f03e6113f4e" title="Return the number of key/data pairs in the B+ tree.">size</a>());
<a name="l02636"></a>02636 
<a name="l02637"></a>02637         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>) <a class="code" href="a00001.html#ad7008114b409fe53a5739a69f3b90e59" title="Run a thorough verification of all B+ tree invariants.">verify</a>();
<a name="l02638"></a>02638 
<a name="l02639"></a>02639         <span class="keywordflow">if</span> (!<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>) <span class="keywordflow">return</span>;
<a name="l02640"></a>02640 
<a name="l02641"></a>02641         result_t result = <a class="code" href="a00001.html#a28e069672d73503156b4bc604064c4ac" title="Erase one key/data pair referenced by an iterator in the B+ tree.">erase_iter_descend</a>(iter, <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>, NULL, NULL, NULL, NULL, NULL, 0);
<a name="l02642"></a>02642 
<a name="l02643"></a>02643         <span class="keywordflow">if</span> (!result.has(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba9c5aae923574ee89980049e9088f943e" title="Deletion not successful because key was not found.">btree_not_found</a>))
<a name="l02644"></a>02644             --<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a>;
<a name="l02645"></a>02645 
<a name="l02646"></a>02646 #ifdef BTREE_DEBUG
<a name="l02647"></a>02647         if (<a class="code" href="a00001.html#a224f31a88d50490e14f0f291d70ef2fc" title="Debug parameter: Prints out lots of debug information about how the algorithms change the tree...">debug</a>) <a class="code" href="a00001.html#a29af931b81dc3446d1ffadab6fd5e017" title="Print out the B+ tree structure with keys onto the given ostream.">print</a>(std::cout);
<a name="l02648"></a>02648 <span class="preprocessor">#endif</span>
<a name="l02649"></a>02649 <span class="preprocessor"></span>        <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>) <a class="code" href="a00001.html#ad7008114b409fe53a5739a69f3b90e59" title="Run a thorough verification of all B+ tree invariants.">verify</a>();
<a name="l02650"></a>02650     }
<a name="l02651"></a>02651 
<a name="l02652"></a>02652 <span class="preprocessor">#ifdef BTREE_TODO</span>
<a name="l02653"></a>02653 <span class="preprocessor"></span><span class="comment">    /// Erase all key/data pairs in the range [first,last). This function is</span>
<a name="l02654"></a>02654 <span class="comment"></span><span class="comment">    /// currently not implemented by the B+ Tree.</span>
<a name="l02655"></a><a class="code" href="a00001.html#ae89ad4210d7a1f320af633818b28a9f2">02655</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#a8bced926ecf575a393e06ca7d35291f1" title="Erases all the key/data pairs associated with the given key.">erase</a>(iterator <span class="comment">/* first */</span>, iterator <span class="comment">/* last */</span>)
<a name="l02656"></a>02656     {
<a name="l02657"></a>02657         abort();
<a name="l02658"></a>02658     }
<a name="l02659"></a>02659 <span class="preprocessor">#endif</span>
<a name="l02660"></a>02660 <span class="preprocessor"></span>
<a name="l02661"></a>02661 <span class="keyword">private</span>:
<a name="l02662"></a>02662     <span class="comment">// *** Private Erase Functions</span>
<a name="l02663"></a>02663 <span class="comment"></span>
<a name="l02664"></a>02664 <span class="comment">    /** @brief Erase one (the first) key/data pair in the B+ tree matching key.</span>
<a name="l02665"></a>02665 <span class="comment">     *</span>
<a name="l02666"></a>02666 <span class="comment">     * Descends down the tree in search of key. During the descent the parent,</span>
<a name="l02667"></a>02667 <span class="comment">     * left and right siblings and their parents are computed and passed</span>
<a name="l02668"></a>02668 <span class="comment">     * down. Once the key/data pair is found, it is removed from the leaf. If</span>
<a name="l02669"></a>02669 <span class="comment">     * the leaf underflows 6 different cases are handled. These cases resolve</span>
<a name="l02670"></a>02670 <span class="comment">     * the underflow by shifting key/data pairs from adjacent sibling nodes,</span>
<a name="l02671"></a>02671 <span class="comment">     * merging two sibling nodes or trimming the tree.</span>
<a name="l02672"></a>02672 <span class="comment">     */</span>
<a name="l02673"></a><a class="code" href="a00001.html#a141c007e7d7dce479b2797f3a0735d03">02673</a>     result_t <a class="code" href="a00001.html#a141c007e7d7dce479b2797f3a0735d03" title="Erase one (the first) key/data pair in the B+ tree matching key.">erase_one_descend</a>(<span class="keyword">const</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>&amp; key,
<a name="l02674"></a>02674                                node *curr,
<a name="l02675"></a>02675                                node *left, node *right,
<a name="l02676"></a>02676                                inner_node *leftparent, inner_node *rightparent,
<a name="l02677"></a>02677                                inner_node *parent, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> parentslot)
<a name="l02678"></a>02678     {
<a name="l02679"></a>02679         <span class="keywordflow">if</span> (curr-&gt;isleafnode())
<a name="l02680"></a>02680         {
<a name="l02681"></a>02681             leaf_node *leaf = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(curr);
<a name="l02682"></a>02682             leaf_node *leftleaf = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(left);
<a name="l02683"></a>02683             leaf_node *rightleaf = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(right);
<a name="l02684"></a>02684 
<a name="l02685"></a>02685             <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(leaf, key);
<a name="l02686"></a>02686 
<a name="l02687"></a>02687             <span class="keywordflow">if</span> (slot &gt;= leaf-&gt;slotuse || !<a class="code" href="a00001.html#ac3b0c8e750101dfad0ef70c54532dd68" title="True if a == b ? constructed from key_less().">key_equal</a>(key, leaf-&gt;slotkey[slot]))
<a name="l02688"></a>02688             {
<a name="l02689"></a>02689                 <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Could not find key &quot;</span> &lt;&lt; key &lt;&lt; <span class="stringliteral">&quot; to erase.&quot;</span>);
<a name="l02690"></a>02690 
<a name="l02691"></a>02691                 <span class="keywordflow">return</span> <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba9c5aae923574ee89980049e9088f943e" title="Deletion not successful because key was not found.">btree_not_found</a>;
<a name="l02692"></a>02692             }
<a name="l02693"></a>02693 
<a name="l02694"></a>02694             <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Found key in leaf &quot;</span> &lt;&lt; curr &lt;&lt; <span class="stringliteral">&quot; at slot &quot;</span> &lt;&lt; slot);
<a name="l02695"></a>02695 
<a name="l02696"></a>02696             std::copy(leaf-&gt;slotkey + slot+1, leaf-&gt;slotkey + leaf-&gt;slotuse,
<a name="l02697"></a>02697                       leaf-&gt;slotkey + slot);
<a name="l02698"></a>02698             <a class="code" href="a00001.html#ad8a89e088fbfedec4218ea46f8899941" title="Convenient template function for conditional copying of slotdata.">data_copy</a>(leaf-&gt;slotdata + slot+1, leaf-&gt;slotdata + leaf-&gt;slotuse,
<a name="l02699"></a>02699                       leaf-&gt;slotdata + slot);
<a name="l02700"></a>02700 
<a name="l02701"></a>02701             leaf-&gt;slotuse--;
<a name="l02702"></a>02702 
<a name="l02703"></a>02703             result_t myres = <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02bae9409a8c5c6d8b59e3fd6a70e1106d88" title="Deletion successful and no fix-ups necessary.">btree_ok</a>;
<a name="l02704"></a>02704 
<a name="l02705"></a>02705             <span class="comment">// if the last key of the leaf was changed, the parent is notified</span>
<a name="l02706"></a>02706             <span class="comment">// and updates the key of this leaf</span>
<a name="l02707"></a>02707             <span class="keywordflow">if</span> (slot == leaf-&gt;slotuse)
<a name="l02708"></a>02708             {
<a name="l02709"></a>02709                 <span class="keywordflow">if</span> (parent &amp;&amp; parentslot &lt; parent-&gt;slotuse)
<a name="l02710"></a>02710                 {
<a name="l02711"></a>02711                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[parentslot] == curr);
<a name="l02712"></a>02712                     parent-&gt;slotkey[parentslot] = leaf-&gt;slotkey[leaf-&gt;slotuse - 1];
<a name="l02713"></a>02713                 }
<a name="l02714"></a>02714                 <span class="keywordflow">else</span>
<a name="l02715"></a>02715                 {
<a name="l02716"></a>02716                     <span class="keywordflow">if</span> (leaf-&gt;slotuse &gt;= 1)
<a name="l02717"></a>02717                     {
<a name="l02718"></a>02718                         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Scheduling lastkeyupdate: key &quot;</span> &lt;&lt; leaf-&gt;slotkey[leaf-&gt;slotuse - 1]);
<a name="l02719"></a>02719                         myres |= result_t(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba7e66903441bb2c3c8164040f9efea0d8" title="Deletion successful, the last key was updated so parent slotkeys need updates.">btree_update_lastkey</a>, leaf-&gt;slotkey[leaf-&gt;slotuse - 1]);
<a name="l02720"></a>02720                     }
<a name="l02721"></a>02721                     <span class="keywordflow">else</span>
<a name="l02722"></a>02722                     {
<a name="l02723"></a>02723                         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leaf == <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l02724"></a>02724                     }
<a name="l02725"></a>02725                 }
<a name="l02726"></a>02726             }
<a name="l02727"></a>02727 
<a name="l02728"></a>02728             <span class="keywordflow">if</span> (leaf-&gt;isunderflow() &amp;&amp; !(leaf == <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> &amp;&amp; leaf-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> &gt;= 1))
<a name="l02729"></a>02729             {
<a name="l02730"></a>02730                 <span class="comment">// determine what to do about the underflow</span>
<a name="l02731"></a>02731 
<a name="l02732"></a>02732                 <span class="comment">// case : if this empty leaf is the root, then delete all nodes</span>
<a name="l02733"></a>02733                 <span class="comment">// and set root to NULL.</span>
<a name="l02734"></a>02734                 <span class="keywordflow">if</span> (leftleaf == NULL &amp;&amp; rightleaf == NULL)
<a name="l02735"></a>02735                 {
<a name="l02736"></a>02736                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leaf == <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l02737"></a>02737                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leaf-&gt;slotuse == 0);
<a name="l02738"></a>02738 
<a name="l02739"></a>02739                     <a class="code" href="a00001.html#a1bac362a2e8585e6682d332c9b4ec583" title="Correctly free either inner or leaf node, destructs all contained key and value objects.">free_node</a>(<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l02740"></a>02740 
<a name="l02741"></a>02741                     <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> = leaf = NULL;
<a name="l02742"></a>02742                     <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a> = <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> = NULL;
<a name="l02743"></a>02743 
<a name="l02744"></a>02744                     <span class="comment">// will be decremented soon by insert_start()</span>
<a name="l02745"></a>02745                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a> == 1);
<a name="l02746"></a>02746                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#aa4d4f72b9a8f7a58424063aa1d4a1fcc" title="Number of leaves in the B+ tree.">leaves</a> == 0);
<a name="l02747"></a>02747                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#ab63b03a814b985680a46151fd9f59e17" title="Number of inner nodes in the B+ tree.">innernodes</a> == 0);
<a name="l02748"></a>02748 
<a name="l02749"></a>02749                     <span class="keywordflow">return</span> <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02bae9409a8c5c6d8b59e3fd6a70e1106d88" title="Deletion successful and no fix-ups necessary.">btree_ok</a>;
<a name="l02750"></a>02750                 }
<a name="l02751"></a>02751                 <span class="comment">// case : if both left and right leaves would underflow in case of</span>
<a name="l02752"></a>02752                 <span class="comment">// a shift, then merging is necessary. choose the more local merger</span>
<a name="l02753"></a>02753                 <span class="comment">// with our parent</span>
<a name="l02754"></a>02754                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (leftleaf == NULL || leftleaf-&gt;isfew()) &amp;&amp; (rightleaf == NULL || rightleaf-&gt;isfew()) )
<a name="l02755"></a>02755                 {
<a name="l02756"></a>02756                     <span class="keywordflow">if</span> (leftparent == parent)
<a name="l02757"></a>02757                         myres |= <a class="code" href="a00001.html#a8fde1571d49bf44f58f492ccad6875f9" title="Merge two leaf nodes.">merge_leaves</a>(leftleaf, leaf, leftparent);
<a name="l02758"></a>02758                     <span class="keywordflow">else</span>
<a name="l02759"></a>02759                         myres |= <a class="code" href="a00001.html#a8fde1571d49bf44f58f492ccad6875f9" title="Merge two leaf nodes.">merge_leaves</a>(leaf, rightleaf, rightparent);
<a name="l02760"></a>02760                 }
<a name="l02761"></a>02761                 <span class="comment">// case : the right leaf has extra data, so balance right with current</span>
<a name="l02762"></a>02762                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (leftleaf != NULL &amp;&amp; leftleaf-&gt;isfew()) &amp;&amp; (rightleaf != NULL &amp;&amp; !rightleaf-&gt;isfew()) )
<a name="l02763"></a>02763                 {
<a name="l02764"></a>02764                     <span class="keywordflow">if</span> (rightparent == parent)
<a name="l02765"></a>02765                         myres |= <a class="code" href="a00001.html#a11529634e6a0fd90440272d0b8caf249" title="Balance two leaf nodes.">shift_left_leaf</a>(leaf, rightleaf, rightparent, parentslot);
<a name="l02766"></a>02766                     <span class="keywordflow">else</span>
<a name="l02767"></a>02767                         myres |= <a class="code" href="a00001.html#a8fde1571d49bf44f58f492ccad6875f9" title="Merge two leaf nodes.">merge_leaves</a>(leftleaf, leaf, leftparent);
<a name="l02768"></a>02768                 }
<a name="l02769"></a>02769                 <span class="comment">// case : the left leaf has extra data, so balance left with current</span>
<a name="l02770"></a>02770                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (leftleaf != NULL &amp;&amp; !leftleaf-&gt;isfew()) &amp;&amp; (rightleaf != NULL &amp;&amp; rightleaf-&gt;isfew()) )
<a name="l02771"></a>02771                 {
<a name="l02772"></a>02772                     <span class="keywordflow">if</span> (leftparent == parent)
<a name="l02773"></a>02773                         <a class="code" href="a00001.html#acb8565c057e6c9923adbae0e96f51523" title="Balance two leaf nodes.">shift_right_leaf</a>(leftleaf, leaf, leftparent, parentslot - 1);
<a name="l02774"></a>02774                     <span class="keywordflow">else</span>
<a name="l02775"></a>02775                         myres |= <a class="code" href="a00001.html#a8fde1571d49bf44f58f492ccad6875f9" title="Merge two leaf nodes.">merge_leaves</a>(leaf, rightleaf, rightparent);
<a name="l02776"></a>02776                 }
<a name="l02777"></a>02777                 <span class="comment">// case : both the leaf and right leaves have extra data and our</span>
<a name="l02778"></a>02778                 <span class="comment">// parent, choose the leaf with more data</span>
<a name="l02779"></a>02779                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (leftparent == rightparent)
<a name="l02780"></a>02780                 {
<a name="l02781"></a>02781                     <span class="keywordflow">if</span> (leftleaf-&gt;slotuse &lt;= rightleaf-&gt;slotuse)
<a name="l02782"></a>02782                         myres |= <a class="code" href="a00001.html#a11529634e6a0fd90440272d0b8caf249" title="Balance two leaf nodes.">shift_left_leaf</a>(leaf, rightleaf, rightparent, parentslot);
<a name="l02783"></a>02783                     <span class="keywordflow">else</span>
<a name="l02784"></a>02784                         <a class="code" href="a00001.html#acb8565c057e6c9923adbae0e96f51523" title="Balance two leaf nodes.">shift_right_leaf</a>(leftleaf, leaf, leftparent, parentslot - 1);
<a name="l02785"></a>02785                 }
<a name="l02786"></a>02786                 <span class="keywordflow">else</span>
<a name="l02787"></a>02787                 {
<a name="l02788"></a>02788                     <span class="keywordflow">if</span> (leftparent == parent)
<a name="l02789"></a>02789                         <a class="code" href="a00001.html#acb8565c057e6c9923adbae0e96f51523" title="Balance two leaf nodes.">shift_right_leaf</a>(leftleaf, leaf, leftparent, parentslot - 1);
<a name="l02790"></a>02790                     <span class="keywordflow">else</span>
<a name="l02791"></a>02791                         myres |= <a class="code" href="a00001.html#a11529634e6a0fd90440272d0b8caf249" title="Balance two leaf nodes.">shift_left_leaf</a>(leaf, rightleaf, rightparent, parentslot);
<a name="l02792"></a>02792                 }
<a name="l02793"></a>02793             }
<a name="l02794"></a>02794 
<a name="l02795"></a>02795             <span class="keywordflow">return</span> myres;
<a name="l02796"></a>02796         }
<a name="l02797"></a>02797         <span class="keywordflow">else</span> <span class="comment">// !curr-&gt;isleafnode()</span>
<a name="l02798"></a>02798         {
<a name="l02799"></a>02799             inner_node *inner = <span class="keyword">static_cast&lt;</span>inner_node*<span class="keyword">&gt;</span>(curr);
<a name="l02800"></a>02800             inner_node *leftinner = <span class="keyword">static_cast&lt;</span>inner_node*<span class="keyword">&gt;</span>(left);
<a name="l02801"></a>02801             inner_node *rightinner = <span class="keyword">static_cast&lt;</span>inner_node*<span class="keyword">&gt;</span>(right);
<a name="l02802"></a>02802 
<a name="l02803"></a>02803             node *myleft, *myright;
<a name="l02804"></a>02804             inner_node *myleftparent, *myrightparent;
<a name="l02805"></a>02805 
<a name="l02806"></a>02806             <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(inner, key);
<a name="l02807"></a>02807 
<a name="l02808"></a>02808             <span class="keywordflow">if</span> (slot == 0) {
<a name="l02809"></a>02809                 myleft = (left == NULL) ? NULL : (static_cast&lt;inner_node*&gt;(left))-&gt;childid[left-&gt;slotuse - 1];
<a name="l02810"></a>02810                 myleftparent = leftparent;
<a name="l02811"></a>02811             }
<a name="l02812"></a>02812             <span class="keywordflow">else</span> {
<a name="l02813"></a>02813                 myleft = inner-&gt;childid[slot - 1];
<a name="l02814"></a>02814                 myleftparent = inner;
<a name="l02815"></a>02815             }
<a name="l02816"></a>02816 
<a name="l02817"></a>02817             <span class="keywordflow">if</span> (slot == inner-&gt;slotuse) {
<a name="l02818"></a>02818                 myright = (right == NULL) ? NULL : (static_cast&lt;inner_node*&gt;(right))-&gt;childid[0];
<a name="l02819"></a>02819                 myrightparent = rightparent;
<a name="l02820"></a>02820             }
<a name="l02821"></a>02821             <span class="keywordflow">else</span> {
<a name="l02822"></a>02822                 myright = inner-&gt;childid[slot + 1];
<a name="l02823"></a>02823                 myrightparent = inner;
<a name="l02824"></a>02824             }
<a name="l02825"></a>02825 
<a name="l02826"></a>02826             <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;erase_one_descend into &quot;</span> &lt;&lt; inner-&gt;childid[slot]);
<a name="l02827"></a>02827 
<a name="l02828"></a>02828             result_t result = <a class="code" href="a00001.html#a141c007e7d7dce479b2797f3a0735d03" title="Erase one (the first) key/data pair in the B+ tree matching key.">erase_one_descend</a>(key,
<a name="l02829"></a>02829                                                 inner-&gt;childid[slot],
<a name="l02830"></a>02830                                                 myleft, myright,
<a name="l02831"></a>02831                                                 myleftparent, myrightparent,
<a name="l02832"></a>02832                                                 inner, slot);
<a name="l02833"></a>02833 
<a name="l02834"></a>02834             result_t myres = <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02bae9409a8c5c6d8b59e3fd6a70e1106d88" title="Deletion successful and no fix-ups necessary.">btree_ok</a>;
<a name="l02835"></a>02835 
<a name="l02836"></a>02836             <span class="keywordflow">if</span> (result.has(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba9c5aae923574ee89980049e9088f943e" title="Deletion not successful because key was not found.">btree_not_found</a>))
<a name="l02837"></a>02837             {
<a name="l02838"></a>02838                 <span class="keywordflow">return</span> result;
<a name="l02839"></a>02839             }
<a name="l02840"></a>02840 
<a name="l02841"></a>02841             <span class="keywordflow">if</span> (result.has(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba7e66903441bb2c3c8164040f9efea0d8" title="Deletion successful, the last key was updated so parent slotkeys need updates.">btree_update_lastkey</a>))
<a name="l02842"></a>02842             {
<a name="l02843"></a>02843                 <span class="keywordflow">if</span> (parent &amp;&amp; parentslot &lt; parent-&gt;slotuse)
<a name="l02844"></a>02844                 {
<a name="l02845"></a>02845                     <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Fixing lastkeyupdate: key &quot;</span> &lt;&lt; result.lastkey &lt;&lt; <span class="stringliteral">&quot; into parent &quot;</span> &lt;&lt; parent &lt;&lt; <span class="stringliteral">&quot; at parentslot &quot;</span> &lt;&lt; parentslot);
<a name="l02846"></a>02846 
<a name="l02847"></a>02847                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[parentslot] == curr);
<a name="l02848"></a>02848                     parent-&gt;slotkey[parentslot] = result.lastkey;
<a name="l02849"></a>02849                 }
<a name="l02850"></a>02850                 <span class="keywordflow">else</span>
<a name="l02851"></a>02851                 {
<a name="l02852"></a>02852                     <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Forwarding lastkeyupdate: key &quot;</span> &lt;&lt; result.lastkey);
<a name="l02853"></a>02853                     myres |= result_t(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba7e66903441bb2c3c8164040f9efea0d8" title="Deletion successful, the last key was updated so parent slotkeys need updates.">btree_update_lastkey</a>, result.lastkey);
<a name="l02854"></a>02854                 }
<a name="l02855"></a>02855             }
<a name="l02856"></a>02856 
<a name="l02857"></a>02857             <span class="keywordflow">if</span> (result.has(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba22159386e444003f86027c412d28ef43" title="Deletion successful, children nodes were merged and the parent needs to remove the empty node...">btree_fixmerge</a>))
<a name="l02858"></a>02858             {
<a name="l02859"></a>02859                 <span class="comment">// either the current node or the next is empty and should be removed</span>
<a name="l02860"></a>02860                 <span class="keywordflow">if</span> (inner-&gt;childid[slot]-&gt;slotuse != 0)
<a name="l02861"></a>02861                     slot++;
<a name="l02862"></a>02862 
<a name="l02863"></a>02863                 <span class="comment">// this is the child slot invalidated by the merge</span>
<a name="l02864"></a>02864                 <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(inner-&gt;childid[slot]-&gt;slotuse == 0);
<a name="l02865"></a>02865 
<a name="l02866"></a>02866                 <a class="code" href="a00001.html#a1bac362a2e8585e6682d332c9b4ec583" title="Correctly free either inner or leaf node, destructs all contained key and value objects.">free_node</a>(inner-&gt;childid[slot]);
<a name="l02867"></a>02867 
<a name="l02868"></a>02868                 std::copy(inner-&gt;slotkey + slot, inner-&gt;slotkey + inner-&gt;slotuse,
<a name="l02869"></a>02869                           inner-&gt;slotkey + slot-1);
<a name="l02870"></a>02870                 std::copy(inner-&gt;childid + slot+1, inner-&gt;childid + inner-&gt;slotuse+1,
<a name="l02871"></a>02871                           inner-&gt;childid + slot);
<a name="l02872"></a>02872 
<a name="l02873"></a>02873                 inner-&gt;slotuse--;
<a name="l02874"></a>02874 
<a name="l02875"></a>02875                 <span class="keywordflow">if</span> (inner-&gt;level == 1)
<a name="l02876"></a>02876                 {
<a name="l02877"></a>02877                     <span class="comment">// fix split key for children leaves</span>
<a name="l02878"></a>02878                     slot--;
<a name="l02879"></a>02879                     leaf_node *child = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(inner-&gt;childid[slot]);
<a name="l02880"></a>02880                     inner-&gt;slotkey[slot] = child-&gt;slotkey[ child-&gt;slotuse-1 ];
<a name="l02881"></a>02881                 }
<a name="l02882"></a>02882             }
<a name="l02883"></a>02883 
<a name="l02884"></a>02884             <span class="keywordflow">if</span> (inner-&gt;isunderflow() &amp;&amp; !(inner == <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> &amp;&amp; inner-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> &gt;= 1))
<a name="l02885"></a>02885             {
<a name="l02886"></a>02886                 <span class="comment">// case: the inner node is the root and has just one child. that child becomes the new root</span>
<a name="l02887"></a>02887                 <span class="keywordflow">if</span> (leftinner == NULL &amp;&amp; rightinner == NULL)
<a name="l02888"></a>02888                 {
<a name="l02889"></a>02889                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(inner == <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l02890"></a>02890                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(inner-&gt;slotuse == 0);
<a name="l02891"></a>02891 
<a name="l02892"></a>02892                     <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> = inner-&gt;childid[0];
<a name="l02893"></a>02893 
<a name="l02894"></a>02894                     inner-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> = 0;
<a name="l02895"></a>02895                     <a class="code" href="a00001.html#a1bac362a2e8585e6682d332c9b4ec583" title="Correctly free either inner or leaf node, destructs all contained key and value objects.">free_node</a>(inner);
<a name="l02896"></a>02896 
<a name="l02897"></a>02897                     <span class="keywordflow">return</span> <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02bae9409a8c5c6d8b59e3fd6a70e1106d88" title="Deletion successful and no fix-ups necessary.">btree_ok</a>;
<a name="l02898"></a>02898                 }
<a name="l02899"></a>02899                 <span class="comment">// case : if both left and right leaves would underflow in case of</span>
<a name="l02900"></a>02900                 <span class="comment">// a shift, then merging is necessary. choose the more local merger</span>
<a name="l02901"></a>02901                 <span class="comment">// with our parent</span>
<a name="l02902"></a>02902                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (leftinner == NULL || leftinner-&gt;isfew()) &amp;&amp; (rightinner == NULL || rightinner-&gt;isfew()) )
<a name="l02903"></a>02903                 {
<a name="l02904"></a>02904                     <span class="keywordflow">if</span> (leftparent == parent)
<a name="l02905"></a>02905                         myres |= <a class="code" href="a00001.html#ae41ed6372b1f0e7cc76d082fb7d0c18c" title="Merge two inner nodes.">merge_inner</a>(leftinner, inner, leftparent, parentslot - 1);
<a name="l02906"></a>02906                     <span class="keywordflow">else</span>
<a name="l02907"></a>02907                         myres |= <a class="code" href="a00001.html#ae41ed6372b1f0e7cc76d082fb7d0c18c" title="Merge two inner nodes.">merge_inner</a>(inner, rightinner, rightparent, parentslot);
<a name="l02908"></a>02908                 }
<a name="l02909"></a>02909                 <span class="comment">// case : the right leaf has extra data, so balance right with current</span>
<a name="l02910"></a>02910                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (leftinner != NULL &amp;&amp; leftinner-&gt;isfew()) &amp;&amp; (rightinner != NULL &amp;&amp; !rightinner-&gt;isfew()) )
<a name="l02911"></a>02911                 {
<a name="l02912"></a>02912                     <span class="keywordflow">if</span> (rightparent == parent)
<a name="l02913"></a>02913                         <a class="code" href="a00001.html#a8abbc58dfcbb672bc1273a402b57b750" title="Balance two inner nodes.">shift_left_inner</a>(inner, rightinner, rightparent, parentslot);
<a name="l02914"></a>02914                     <span class="keywordflow">else</span>
<a name="l02915"></a>02915                         myres |= <a class="code" href="a00001.html#ae41ed6372b1f0e7cc76d082fb7d0c18c" title="Merge two inner nodes.">merge_inner</a>(leftinner, inner, leftparent, parentslot - 1);
<a name="l02916"></a>02916                 }
<a name="l02917"></a>02917                 <span class="comment">// case : the left leaf has extra data, so balance left with current</span>
<a name="l02918"></a>02918                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (leftinner != NULL &amp;&amp; !leftinner-&gt;isfew()) &amp;&amp; (rightinner != NULL &amp;&amp; rightinner-&gt;isfew()) )
<a name="l02919"></a>02919                 {
<a name="l02920"></a>02920                     <span class="keywordflow">if</span> (leftparent == parent)
<a name="l02921"></a>02921                         <a class="code" href="a00001.html#a4aebdb2c529528d5f17d14b9b0ec1f24" title="Balance two inner nodes.">shift_right_inner</a>(leftinner, inner, leftparent, parentslot - 1);
<a name="l02922"></a>02922                     <span class="keywordflow">else</span>
<a name="l02923"></a>02923                         myres |= <a class="code" href="a00001.html#ae41ed6372b1f0e7cc76d082fb7d0c18c" title="Merge two inner nodes.">merge_inner</a>(inner, rightinner, rightparent, parentslot);
<a name="l02924"></a>02924                 }
<a name="l02925"></a>02925                 <span class="comment">// case : both the leaf and right leaves have extra data and our</span>
<a name="l02926"></a>02926                 <span class="comment">// parent, choose the leaf with more data</span>
<a name="l02927"></a>02927                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (leftparent == rightparent)
<a name="l02928"></a>02928                 {
<a name="l02929"></a>02929                     <span class="keywordflow">if</span> (leftinner-&gt;slotuse &lt;= rightinner-&gt;slotuse)
<a name="l02930"></a>02930                         <a class="code" href="a00001.html#a8abbc58dfcbb672bc1273a402b57b750" title="Balance two inner nodes.">shift_left_inner</a>(inner, rightinner, rightparent, parentslot);
<a name="l02931"></a>02931                     <span class="keywordflow">else</span>
<a name="l02932"></a>02932                         <a class="code" href="a00001.html#a4aebdb2c529528d5f17d14b9b0ec1f24" title="Balance two inner nodes.">shift_right_inner</a>(leftinner, inner, leftparent, parentslot - 1);
<a name="l02933"></a>02933                 }
<a name="l02934"></a>02934                 <span class="keywordflow">else</span>
<a name="l02935"></a>02935                 {
<a name="l02936"></a>02936                     <span class="keywordflow">if</span> (leftparent == parent)
<a name="l02937"></a>02937                         <a class="code" href="a00001.html#a4aebdb2c529528d5f17d14b9b0ec1f24" title="Balance two inner nodes.">shift_right_inner</a>(leftinner, inner, leftparent, parentslot - 1);
<a name="l02938"></a>02938                     <span class="keywordflow">else</span>
<a name="l02939"></a>02939                         <a class="code" href="a00001.html#a8abbc58dfcbb672bc1273a402b57b750" title="Balance two inner nodes.">shift_left_inner</a>(inner, rightinner, rightparent, parentslot);
<a name="l02940"></a>02940                 }
<a name="l02941"></a>02941             }
<a name="l02942"></a>02942 
<a name="l02943"></a>02943             <span class="keywordflow">return</span> myres;
<a name="l02944"></a>02944         }
<a name="l02945"></a>02945     }
<a name="l02946"></a>02946 <span class="comment"></span>
<a name="l02947"></a>02947 <span class="comment">    /** @brief Erase one key/data pair referenced by an iterator in the B+</span>
<a name="l02948"></a>02948 <span class="comment">     * tree.</span>
<a name="l02949"></a>02949 <span class="comment">     *</span>
<a name="l02950"></a>02950 <span class="comment">     * Descends down the tree in search of an iterator. During the descent the</span>
<a name="l02951"></a>02951 <span class="comment">     * parent, left and right siblings and their parents are computed and</span>
<a name="l02952"></a>02952 <span class="comment">     * passed down. The difficulty is that the iterator contains only a pointer</span>
<a name="l02953"></a>02953 <span class="comment">     * to a leaf_node, which means that this function must do a recursive depth</span>
<a name="l02954"></a>02954 <span class="comment">     * first search for that leaf node in the subtree containing all pairs of</span>
<a name="l02955"></a>02955 <span class="comment">     * the same key. This subtree can be very large, even the whole tree,</span>
<a name="l02956"></a>02956 <span class="comment">     * though in practice it would not make sense to have so many duplicate</span>
<a name="l02957"></a>02957 <span class="comment">     * keys.</span>
<a name="l02958"></a>02958 <span class="comment">     *</span>
<a name="l02959"></a>02959 <span class="comment">     * Once the referenced key/data pair is found, it is removed from the leaf</span>
<a name="l02960"></a>02960 <span class="comment">     * and the same underflow cases are handled as in erase_one_descend.</span>
<a name="l02961"></a>02961 <span class="comment">     */</span>
<a name="l02962"></a><a class="code" href="a00001.html#a28e069672d73503156b4bc604064c4ac">02962</a>     result_t <a class="code" href="a00001.html#a28e069672d73503156b4bc604064c4ac" title="Erase one key/data pair referenced by an iterator in the B+ tree.">erase_iter_descend</a>(<span class="keyword">const</span> iterator&amp; iter,
<a name="l02963"></a>02963                                 node *curr,
<a name="l02964"></a>02964                                 node *left, node *right,
<a name="l02965"></a>02965                                 inner_node *leftparent, inner_node *rightparent,
<a name="l02966"></a>02966                                 inner_node *parent, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> parentslot)
<a name="l02967"></a>02967     {
<a name="l02968"></a>02968         <span class="keywordflow">if</span> (curr-&gt;isleafnode())
<a name="l02969"></a>02969         {
<a name="l02970"></a>02970             leaf_node *leaf = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(curr);
<a name="l02971"></a>02971             leaf_node *leftleaf = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(left);
<a name="l02972"></a>02972             leaf_node *rightleaf = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(right);
<a name="l02973"></a>02973 
<a name="l02974"></a>02974             <span class="comment">// if this is not the correct leaf, get next step in recursive</span>
<a name="l02975"></a>02975             <span class="comment">// search</span>
<a name="l02976"></a>02976             <span class="keywordflow">if</span> (leaf != iter.currnode)
<a name="l02977"></a>02977             {
<a name="l02978"></a>02978                 <span class="keywordflow">return</span> <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba9c5aae923574ee89980049e9088f943e" title="Deletion not successful because key was not found.">btree_not_found</a>;
<a name="l02979"></a>02979             }
<a name="l02980"></a>02980 
<a name="l02981"></a>02981             <span class="keywordflow">if</span> (iter.currslot &gt;= leaf-&gt;slotuse)
<a name="l02982"></a>02982             {
<a name="l02983"></a>02983                 <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Could not find iterator (&quot;</span> &lt;&lt; iter.currnode &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; iter.currslot &lt;&lt; <span class="stringliteral">&quot;) to erase. Invalid leaf node?&quot;</span>);
<a name="l02984"></a>02984 
<a name="l02985"></a>02985                 <span class="keywordflow">return</span> <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba9c5aae923574ee89980049e9088f943e" title="Deletion not successful because key was not found.">btree_not_found</a>;
<a name="l02986"></a>02986             }
<a name="l02987"></a>02987 
<a name="l02988"></a>02988             <span class="keywordtype">int</span> slot = iter.currslot;
<a name="l02989"></a>02989 
<a name="l02990"></a>02990             <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Found iterator in leaf &quot;</span> &lt;&lt; curr &lt;&lt; <span class="stringliteral">&quot; at slot &quot;</span> &lt;&lt; slot);
<a name="l02991"></a>02991 
<a name="l02992"></a>02992             std::copy(leaf-&gt;slotkey + slot+1, leaf-&gt;slotkey + leaf-&gt;slotuse,
<a name="l02993"></a>02993                       leaf-&gt;slotkey + slot);
<a name="l02994"></a>02994             <a class="code" href="a00001.html#ad8a89e088fbfedec4218ea46f8899941" title="Convenient template function for conditional copying of slotdata.">data_copy</a>(leaf-&gt;slotdata + slot+1, leaf-&gt;slotdata + leaf-&gt;slotuse,
<a name="l02995"></a>02995                       leaf-&gt;slotdata + slot);
<a name="l02996"></a>02996 
<a name="l02997"></a>02997             leaf-&gt;slotuse--;
<a name="l02998"></a>02998 
<a name="l02999"></a>02999             result_t myres = <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02bae9409a8c5c6d8b59e3fd6a70e1106d88" title="Deletion successful and no fix-ups necessary.">btree_ok</a>;
<a name="l03000"></a>03000 
<a name="l03001"></a>03001             <span class="comment">// if the last key of the leaf was changed, the parent is notified</span>
<a name="l03002"></a>03002             <span class="comment">// and updates the key of this leaf</span>
<a name="l03003"></a>03003             <span class="keywordflow">if</span> (slot == leaf-&gt;slotuse)
<a name="l03004"></a>03004             {
<a name="l03005"></a>03005                 <span class="keywordflow">if</span> (parent &amp;&amp; parentslot &lt; parent-&gt;slotuse)
<a name="l03006"></a>03006                 {
<a name="l03007"></a>03007                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[parentslot] == curr);
<a name="l03008"></a>03008                     parent-&gt;slotkey[parentslot] = leaf-&gt;slotkey[leaf-&gt;slotuse - 1];
<a name="l03009"></a>03009                 }
<a name="l03010"></a>03010                 <span class="keywordflow">else</span>
<a name="l03011"></a>03011                 {
<a name="l03012"></a>03012                     <span class="keywordflow">if</span> (leaf-&gt;slotuse &gt;= 1)
<a name="l03013"></a>03013                     {
<a name="l03014"></a>03014                         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Scheduling lastkeyupdate: key &quot;</span> &lt;&lt; leaf-&gt;slotkey[leaf-&gt;slotuse - 1]);
<a name="l03015"></a>03015                         myres |= result_t(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba7e66903441bb2c3c8164040f9efea0d8" title="Deletion successful, the last key was updated so parent slotkeys need updates.">btree_update_lastkey</a>, leaf-&gt;slotkey[leaf-&gt;slotuse - 1]);
<a name="l03016"></a>03016                     }
<a name="l03017"></a>03017                     <span class="keywordflow">else</span>
<a name="l03018"></a>03018                     {
<a name="l03019"></a>03019                         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leaf == <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l03020"></a>03020                     }
<a name="l03021"></a>03021                 }
<a name="l03022"></a>03022             }
<a name="l03023"></a>03023 
<a name="l03024"></a>03024             <span class="keywordflow">if</span> (leaf-&gt;isunderflow() &amp;&amp; !(leaf == <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> &amp;&amp; leaf-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> &gt;= 1))
<a name="l03025"></a>03025             {
<a name="l03026"></a>03026                 <span class="comment">// determine what to do about the underflow</span>
<a name="l03027"></a>03027 
<a name="l03028"></a>03028                 <span class="comment">// case : if this empty leaf is the root, then delete all nodes</span>
<a name="l03029"></a>03029                 <span class="comment">// and set root to NULL.</span>
<a name="l03030"></a>03030                 <span class="keywordflow">if</span> (leftleaf == NULL &amp;&amp; rightleaf == NULL)
<a name="l03031"></a>03031                 {
<a name="l03032"></a>03032                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leaf == <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l03033"></a>03033                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leaf-&gt;slotuse == 0);
<a name="l03034"></a>03034 
<a name="l03035"></a>03035                     <a class="code" href="a00001.html#a1bac362a2e8585e6682d332c9b4ec583" title="Correctly free either inner or leaf node, destructs all contained key and value objects.">free_node</a>(<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l03036"></a>03036 
<a name="l03037"></a>03037                     <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> = leaf = NULL;
<a name="l03038"></a>03038                     <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a> = <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> = NULL;
<a name="l03039"></a>03039 
<a name="l03040"></a>03040                     <span class="comment">// will be decremented soon by insert_start()</span>
<a name="l03041"></a>03041                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a> == 1);
<a name="l03042"></a>03042                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#aa4d4f72b9a8f7a58424063aa1d4a1fcc" title="Number of leaves in the B+ tree.">leaves</a> == 0);
<a name="l03043"></a>03043                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(<a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#ab63b03a814b985680a46151fd9f59e17" title="Number of inner nodes in the B+ tree.">innernodes</a> == 0);
<a name="l03044"></a>03044 
<a name="l03045"></a>03045                     <span class="keywordflow">return</span> <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02bae9409a8c5c6d8b59e3fd6a70e1106d88" title="Deletion successful and no fix-ups necessary.">btree_ok</a>;
<a name="l03046"></a>03046                 }
<a name="l03047"></a>03047                 <span class="comment">// case : if both left and right leaves would underflow in case of</span>
<a name="l03048"></a>03048                 <span class="comment">// a shift, then merging is necessary. choose the more local merger</span>
<a name="l03049"></a>03049                 <span class="comment">// with our parent</span>
<a name="l03050"></a>03050                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (leftleaf == NULL || leftleaf-&gt;isfew()) &amp;&amp; (rightleaf == NULL || rightleaf-&gt;isfew()) )
<a name="l03051"></a>03051                 {
<a name="l03052"></a>03052                     <span class="keywordflow">if</span> (leftparent == parent)
<a name="l03053"></a>03053                         myres |= <a class="code" href="a00001.html#a8fde1571d49bf44f58f492ccad6875f9" title="Merge two leaf nodes.">merge_leaves</a>(leftleaf, leaf, leftparent);
<a name="l03054"></a>03054                     <span class="keywordflow">else</span>
<a name="l03055"></a>03055                         myres |= <a class="code" href="a00001.html#a8fde1571d49bf44f58f492ccad6875f9" title="Merge two leaf nodes.">merge_leaves</a>(leaf, rightleaf, rightparent);
<a name="l03056"></a>03056                 }
<a name="l03057"></a>03057                 <span class="comment">// case : the right leaf has extra data, so balance right with current</span>
<a name="l03058"></a>03058                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (leftleaf != NULL &amp;&amp; leftleaf-&gt;isfew()) &amp;&amp; (rightleaf != NULL &amp;&amp; !rightleaf-&gt;isfew()) )
<a name="l03059"></a>03059                 {
<a name="l03060"></a>03060                     <span class="keywordflow">if</span> (rightparent == parent)
<a name="l03061"></a>03061                         myres |= <a class="code" href="a00001.html#a11529634e6a0fd90440272d0b8caf249" title="Balance two leaf nodes.">shift_left_leaf</a>(leaf, rightleaf, rightparent, parentslot);
<a name="l03062"></a>03062                     <span class="keywordflow">else</span>
<a name="l03063"></a>03063                         myres |= <a class="code" href="a00001.html#a8fde1571d49bf44f58f492ccad6875f9" title="Merge two leaf nodes.">merge_leaves</a>(leftleaf, leaf, leftparent);
<a name="l03064"></a>03064                 }
<a name="l03065"></a>03065                 <span class="comment">// case : the left leaf has extra data, so balance left with current</span>
<a name="l03066"></a>03066                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (leftleaf != NULL &amp;&amp; !leftleaf-&gt;isfew()) &amp;&amp; (rightleaf != NULL &amp;&amp; rightleaf-&gt;isfew()) )
<a name="l03067"></a>03067                 {
<a name="l03068"></a>03068                     <span class="keywordflow">if</span> (leftparent == parent)
<a name="l03069"></a>03069                         <a class="code" href="a00001.html#acb8565c057e6c9923adbae0e96f51523" title="Balance two leaf nodes.">shift_right_leaf</a>(leftleaf, leaf, leftparent, parentslot - 1);
<a name="l03070"></a>03070                     <span class="keywordflow">else</span>
<a name="l03071"></a>03071                         myres |= <a class="code" href="a00001.html#a8fde1571d49bf44f58f492ccad6875f9" title="Merge two leaf nodes.">merge_leaves</a>(leaf, rightleaf, rightparent);
<a name="l03072"></a>03072                 }
<a name="l03073"></a>03073                 <span class="comment">// case : both the leaf and right leaves have extra data and our</span>
<a name="l03074"></a>03074                 <span class="comment">// parent, choose the leaf with more data</span>
<a name="l03075"></a>03075                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (leftparent == rightparent)
<a name="l03076"></a>03076                 {
<a name="l03077"></a>03077                     <span class="keywordflow">if</span> (leftleaf-&gt;slotuse &lt;= rightleaf-&gt;slotuse)
<a name="l03078"></a>03078                         myres |= <a class="code" href="a00001.html#a11529634e6a0fd90440272d0b8caf249" title="Balance two leaf nodes.">shift_left_leaf</a>(leaf, rightleaf, rightparent, parentslot);
<a name="l03079"></a>03079                     <span class="keywordflow">else</span>
<a name="l03080"></a>03080                         <a class="code" href="a00001.html#acb8565c057e6c9923adbae0e96f51523" title="Balance two leaf nodes.">shift_right_leaf</a>(leftleaf, leaf, leftparent, parentslot - 1);
<a name="l03081"></a>03081                 }
<a name="l03082"></a>03082                 <span class="keywordflow">else</span>
<a name="l03083"></a>03083                 {
<a name="l03084"></a>03084                     <span class="keywordflow">if</span> (leftparent == parent)
<a name="l03085"></a>03085                         <a class="code" href="a00001.html#acb8565c057e6c9923adbae0e96f51523" title="Balance two leaf nodes.">shift_right_leaf</a>(leftleaf, leaf, leftparent, parentslot - 1);
<a name="l03086"></a>03086                     <span class="keywordflow">else</span>
<a name="l03087"></a>03087                         myres |= <a class="code" href="a00001.html#a11529634e6a0fd90440272d0b8caf249" title="Balance two leaf nodes.">shift_left_leaf</a>(leaf, rightleaf, rightparent, parentslot);
<a name="l03088"></a>03088                 }
<a name="l03089"></a>03089             }
<a name="l03090"></a>03090 
<a name="l03091"></a>03091             <span class="keywordflow">return</span> myres;
<a name="l03092"></a>03092         }
<a name="l03093"></a>03093         <span class="keywordflow">else</span> <span class="comment">// !curr-&gt;isleafnode()</span>
<a name="l03094"></a>03094         {
<a name="l03095"></a>03095             inner_node *inner = <span class="keyword">static_cast&lt;</span>inner_node*<span class="keyword">&gt;</span>(curr);
<a name="l03096"></a>03096             inner_node *leftinner = <span class="keyword">static_cast&lt;</span>inner_node*<span class="keyword">&gt;</span>(left);
<a name="l03097"></a>03097             inner_node *rightinner = <span class="keyword">static_cast&lt;</span>inner_node*<span class="keyword">&gt;</span>(right);
<a name="l03098"></a>03098 
<a name="l03099"></a>03099             <span class="comment">// find first slot below which the searched iterator might be</span>
<a name="l03100"></a>03100             <span class="comment">// located.</span>
<a name="l03101"></a>03101 
<a name="l03102"></a>03102             result_t result;
<a name="l03103"></a>03103             <span class="keywordtype">int</span> slot = <a class="code" href="a00001.html#a605361a6a2254edf8ecdffef35a85669" title="Searches for the first key in the node n greater or equal to key.">find_lower</a>(inner, iter.key());
<a name="l03104"></a>03104 
<a name="l03105"></a>03105             <span class="keywordflow">while</span> (slot &lt;= inner-&gt;slotuse)
<a name="l03106"></a>03106             {
<a name="l03107"></a>03107                 node *myleft, *myright;
<a name="l03108"></a>03108                 inner_node *myleftparent, *myrightparent;
<a name="l03109"></a>03109 
<a name="l03110"></a>03110                 <span class="keywordflow">if</span> (slot == 0) {
<a name="l03111"></a>03111                     myleft = (left == NULL) ? NULL : (static_cast&lt;inner_node*&gt;(left))-&gt;childid[left-&gt;slotuse - 1];
<a name="l03112"></a>03112                     myleftparent = leftparent;
<a name="l03113"></a>03113                 }
<a name="l03114"></a>03114                 <span class="keywordflow">else</span> {
<a name="l03115"></a>03115                     myleft = inner-&gt;childid[slot - 1];
<a name="l03116"></a>03116                     myleftparent = inner;
<a name="l03117"></a>03117                 }
<a name="l03118"></a>03118 
<a name="l03119"></a>03119                 <span class="keywordflow">if</span> (slot == inner-&gt;slotuse) {
<a name="l03120"></a>03120                     myright = (right == NULL) ? NULL : (static_cast&lt;inner_node*&gt;(right))-&gt;childid[0];
<a name="l03121"></a>03121                     myrightparent = rightparent;
<a name="l03122"></a>03122                 }
<a name="l03123"></a>03123                 <span class="keywordflow">else</span> {
<a name="l03124"></a>03124                     myright = inner-&gt;childid[slot + 1];
<a name="l03125"></a>03125                     myrightparent = inner;
<a name="l03126"></a>03126                 }
<a name="l03127"></a>03127 
<a name="l03128"></a>03128                 <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;erase_iter_descend into &quot;</span> &lt;&lt; inner-&gt;childid[slot]);
<a name="l03129"></a>03129 
<a name="l03130"></a>03130                 result = <a class="code" href="a00001.html#a28e069672d73503156b4bc604064c4ac" title="Erase one key/data pair referenced by an iterator in the B+ tree.">erase_iter_descend</a>(iter,
<a name="l03131"></a>03131                                             inner-&gt;childid[slot],
<a name="l03132"></a>03132                                             myleft, myright,
<a name="l03133"></a>03133                                             myleftparent, myrightparent,
<a name="l03134"></a>03134                                             inner, slot);
<a name="l03135"></a>03135 
<a name="l03136"></a>03136                 <span class="keywordflow">if</span> (!result.has(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba9c5aae923574ee89980049e9088f943e" title="Deletion not successful because key was not found.">btree_not_found</a>))
<a name="l03137"></a>03137                     <span class="keywordflow">break</span>;
<a name="l03138"></a>03138 
<a name="l03139"></a>03139                 <span class="comment">// continue recursive search for leaf on next slot</span>
<a name="l03140"></a>03140 
<a name="l03141"></a>03141                 <span class="keywordflow">if</span> (slot &lt; inner-&gt;slotuse &amp;&amp; <a class="code" href="a00001.html#a6ab60bc4547d2363c0a0d1b89e1e6c32" title="True if a &lt; b ? &quot;constructed&quot; from m_key_less()">key_less</a>(inner-&gt;slotkey[slot],iter.key()))
<a name="l03142"></a>03142                     <span class="keywordflow">return</span> <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba9c5aae923574ee89980049e9088f943e" title="Deletion not successful because key was not found.">btree_not_found</a>;
<a name="l03143"></a>03143 
<a name="l03144"></a>03144                 ++slot;
<a name="l03145"></a>03145             }
<a name="l03146"></a>03146 
<a name="l03147"></a>03147             <span class="keywordflow">if</span> (slot &gt; inner-&gt;slotuse)
<a name="l03148"></a>03148                 <span class="keywordflow">return</span> <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba9c5aae923574ee89980049e9088f943e" title="Deletion not successful because key was not found.">btree_not_found</a>;
<a name="l03149"></a>03149 
<a name="l03150"></a>03150             result_t myres = <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02bae9409a8c5c6d8b59e3fd6a70e1106d88" title="Deletion successful and no fix-ups necessary.">btree_ok</a>;
<a name="l03151"></a>03151 
<a name="l03152"></a>03152             <span class="keywordflow">if</span> (result.has(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba7e66903441bb2c3c8164040f9efea0d8" title="Deletion successful, the last key was updated so parent slotkeys need updates.">btree_update_lastkey</a>))
<a name="l03153"></a>03153             {
<a name="l03154"></a>03154                 <span class="keywordflow">if</span> (parent &amp;&amp; parentslot &lt; parent-&gt;slotuse)
<a name="l03155"></a>03155                 {
<a name="l03156"></a>03156                     <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Fixing lastkeyupdate: key &quot;</span> &lt;&lt; result.lastkey &lt;&lt; <span class="stringliteral">&quot; into parent &quot;</span> &lt;&lt; parent &lt;&lt; <span class="stringliteral">&quot; at parentslot &quot;</span> &lt;&lt; parentslot);
<a name="l03157"></a>03157 
<a name="l03158"></a>03158                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[parentslot] == curr);
<a name="l03159"></a>03159                     parent-&gt;slotkey[parentslot] = result.lastkey;
<a name="l03160"></a>03160                 }
<a name="l03161"></a>03161                 <span class="keywordflow">else</span>
<a name="l03162"></a>03162                 {
<a name="l03163"></a>03163                     <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Forwarding lastkeyupdate: key &quot;</span> &lt;&lt; result.lastkey);
<a name="l03164"></a>03164                     myres |= result_t(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba7e66903441bb2c3c8164040f9efea0d8" title="Deletion successful, the last key was updated so parent slotkeys need updates.">btree_update_lastkey</a>, result.lastkey);
<a name="l03165"></a>03165                 }
<a name="l03166"></a>03166             }
<a name="l03167"></a>03167 
<a name="l03168"></a>03168             <span class="keywordflow">if</span> (result.has(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba22159386e444003f86027c412d28ef43" title="Deletion successful, children nodes were merged and the parent needs to remove the empty node...">btree_fixmerge</a>))
<a name="l03169"></a>03169             {
<a name="l03170"></a>03170                 <span class="comment">// either the current node or the next is empty and should be removed</span>
<a name="l03171"></a>03171                 <span class="keywordflow">if</span> (inner-&gt;childid[slot]-&gt;slotuse != 0)
<a name="l03172"></a>03172                     slot++;
<a name="l03173"></a>03173 
<a name="l03174"></a>03174                 <span class="comment">// this is the child slot invalidated by the merge</span>
<a name="l03175"></a>03175                 <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(inner-&gt;childid[slot]-&gt;slotuse == 0);
<a name="l03176"></a>03176 
<a name="l03177"></a>03177                 <a class="code" href="a00001.html#a1bac362a2e8585e6682d332c9b4ec583" title="Correctly free either inner or leaf node, destructs all contained key and value objects.">free_node</a>(inner-&gt;childid[slot]);
<a name="l03178"></a>03178 
<a name="l03179"></a>03179                 std::copy(inner-&gt;slotkey + slot, inner-&gt;slotkey + inner-&gt;slotuse,
<a name="l03180"></a>03180                           inner-&gt;slotkey + slot-1);
<a name="l03181"></a>03181                 std::copy(inner-&gt;childid + slot+1, inner-&gt;childid + inner-&gt;slotuse+1,
<a name="l03182"></a>03182                           inner-&gt;childid + slot);
<a name="l03183"></a>03183 
<a name="l03184"></a>03184                 inner-&gt;slotuse--;
<a name="l03185"></a>03185 
<a name="l03186"></a>03186                 <span class="keywordflow">if</span> (inner-&gt;level == 1)
<a name="l03187"></a>03187                 {
<a name="l03188"></a>03188                     <span class="comment">// fix split key for children leaves</span>
<a name="l03189"></a>03189                     slot--;
<a name="l03190"></a>03190                     leaf_node *child = <span class="keyword">static_cast&lt;</span>leaf_node*<span class="keyword">&gt;</span>(inner-&gt;childid[slot]);
<a name="l03191"></a>03191                     inner-&gt;slotkey[slot] = child-&gt;slotkey[ child-&gt;slotuse-1 ];
<a name="l03192"></a>03192                 }
<a name="l03193"></a>03193             }
<a name="l03194"></a>03194 
<a name="l03195"></a>03195             <span class="keywordflow">if</span> (inner-&gt;isunderflow() &amp;&amp; !(inner == <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> &amp;&amp; inner-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> &gt;= 1))
<a name="l03196"></a>03196             {
<a name="l03197"></a>03197                 <span class="comment">// case: the inner node is the root and has just one</span>
<a name="l03198"></a>03198                 <span class="comment">// child. that child becomes the new root</span>
<a name="l03199"></a>03199                 <span class="keywordflow">if</span> (leftinner == NULL &amp;&amp; rightinner == NULL)
<a name="l03200"></a>03200                 {
<a name="l03201"></a>03201                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(inner == <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l03202"></a>03202                     <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(inner-&gt;slotuse == 0);
<a name="l03203"></a>03203 
<a name="l03204"></a>03204                     <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> = inner-&gt;childid[0];
<a name="l03205"></a>03205 
<a name="l03206"></a>03206                     inner-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> = 0;
<a name="l03207"></a>03207                     <a class="code" href="a00001.html#a1bac362a2e8585e6682d332c9b4ec583" title="Correctly free either inner or leaf node, destructs all contained key and value objects.">free_node</a>(inner);
<a name="l03208"></a>03208 
<a name="l03209"></a>03209                     <span class="keywordflow">return</span> <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02bae9409a8c5c6d8b59e3fd6a70e1106d88" title="Deletion successful and no fix-ups necessary.">btree_ok</a>;
<a name="l03210"></a>03210                 }
<a name="l03211"></a>03211                 <span class="comment">// case : if both left and right leaves would underflow in case of</span>
<a name="l03212"></a>03212                 <span class="comment">// a shift, then merging is necessary. choose the more local merger</span>
<a name="l03213"></a>03213                 <span class="comment">// with our parent</span>
<a name="l03214"></a>03214                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (leftinner == NULL || leftinner-&gt;isfew()) &amp;&amp; (rightinner == NULL || rightinner-&gt;isfew()) )
<a name="l03215"></a>03215                 {
<a name="l03216"></a>03216                     <span class="keywordflow">if</span> (leftparent == parent)
<a name="l03217"></a>03217                         myres |= <a class="code" href="a00001.html#ae41ed6372b1f0e7cc76d082fb7d0c18c" title="Merge two inner nodes.">merge_inner</a>(leftinner, inner, leftparent, parentslot - 1);
<a name="l03218"></a>03218                     <span class="keywordflow">else</span>
<a name="l03219"></a>03219                         myres |= <a class="code" href="a00001.html#ae41ed6372b1f0e7cc76d082fb7d0c18c" title="Merge two inner nodes.">merge_inner</a>(inner, rightinner, rightparent, parentslot);
<a name="l03220"></a>03220                 }
<a name="l03221"></a>03221                 <span class="comment">// case : the right leaf has extra data, so balance right with current</span>
<a name="l03222"></a>03222                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (leftinner != NULL &amp;&amp; leftinner-&gt;isfew()) &amp;&amp; (rightinner != NULL &amp;&amp; !rightinner-&gt;isfew()) )
<a name="l03223"></a>03223                 {
<a name="l03224"></a>03224                     <span class="keywordflow">if</span> (rightparent == parent)
<a name="l03225"></a>03225                         <a class="code" href="a00001.html#a8abbc58dfcbb672bc1273a402b57b750" title="Balance two inner nodes.">shift_left_inner</a>(inner, rightinner, rightparent, parentslot);
<a name="l03226"></a>03226                     <span class="keywordflow">else</span>
<a name="l03227"></a>03227                         myres |= <a class="code" href="a00001.html#ae41ed6372b1f0e7cc76d082fb7d0c18c" title="Merge two inner nodes.">merge_inner</a>(leftinner, inner, leftparent, parentslot - 1);
<a name="l03228"></a>03228                 }
<a name="l03229"></a>03229                 <span class="comment">// case : the left leaf has extra data, so balance left with current</span>
<a name="l03230"></a>03230                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> ( (leftinner != NULL &amp;&amp; !leftinner-&gt;isfew()) &amp;&amp; (rightinner != NULL &amp;&amp; rightinner-&gt;isfew()) )
<a name="l03231"></a>03231                 {
<a name="l03232"></a>03232                     <span class="keywordflow">if</span> (leftparent == parent)
<a name="l03233"></a>03233                         <a class="code" href="a00001.html#a4aebdb2c529528d5f17d14b9b0ec1f24" title="Balance two inner nodes.">shift_right_inner</a>(leftinner, inner, leftparent, parentslot - 1);
<a name="l03234"></a>03234                     <span class="keywordflow">else</span>
<a name="l03235"></a>03235                         myres |= <a class="code" href="a00001.html#ae41ed6372b1f0e7cc76d082fb7d0c18c" title="Merge two inner nodes.">merge_inner</a>(inner, rightinner, rightparent, parentslot);
<a name="l03236"></a>03236                 }
<a name="l03237"></a>03237                 <span class="comment">// case : both the leaf and right leaves have extra data and our</span>
<a name="l03238"></a>03238                 <span class="comment">// parent, choose the leaf with more data</span>
<a name="l03239"></a>03239                 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (leftparent == rightparent)
<a name="l03240"></a>03240                 {
<a name="l03241"></a>03241                     <span class="keywordflow">if</span> (leftinner-&gt;slotuse &lt;= rightinner-&gt;slotuse)
<a name="l03242"></a>03242                         <a class="code" href="a00001.html#a8abbc58dfcbb672bc1273a402b57b750" title="Balance two inner nodes.">shift_left_inner</a>(inner, rightinner, rightparent, parentslot);
<a name="l03243"></a>03243                     <span class="keywordflow">else</span>
<a name="l03244"></a>03244                         <a class="code" href="a00001.html#a4aebdb2c529528d5f17d14b9b0ec1f24" title="Balance two inner nodes.">shift_right_inner</a>(leftinner, inner, leftparent, parentslot - 1);
<a name="l03245"></a>03245                 }
<a name="l03246"></a>03246                 <span class="keywordflow">else</span>
<a name="l03247"></a>03247                 {
<a name="l03248"></a>03248                     <span class="keywordflow">if</span> (leftparent == parent)
<a name="l03249"></a>03249                         <a class="code" href="a00001.html#a4aebdb2c529528d5f17d14b9b0ec1f24" title="Balance two inner nodes.">shift_right_inner</a>(leftinner, inner, leftparent, parentslot - 1);
<a name="l03250"></a>03250                     <span class="keywordflow">else</span>
<a name="l03251"></a>03251                         <a class="code" href="a00001.html#a8abbc58dfcbb672bc1273a402b57b750" title="Balance two inner nodes.">shift_left_inner</a>(inner, rightinner, rightparent, parentslot);
<a name="l03252"></a>03252                 }
<a name="l03253"></a>03253             }
<a name="l03254"></a>03254 
<a name="l03255"></a>03255             <span class="keywordflow">return</span> myres;
<a name="l03256"></a>03256         }
<a name="l03257"></a>03257     }
<a name="l03258"></a>03258 <span class="comment"></span>
<a name="l03259"></a>03259 <span class="comment">    /// Merge two leaf nodes. The function moves all key/data pairs from right</span>
<a name="l03260"></a>03260 <span class="comment">    /// to left and sets right&#39;s slotuse to zero. The right slot is then</span>
<a name="l03261"></a>03261 <span class="comment">    /// removed by the calling parent node.</span>
<a name="l03262"></a><a class="code" href="a00001.html#a8fde1571d49bf44f58f492ccad6875f9">03262</a> <span class="comment"></span>    result_t <a class="code" href="a00001.html#a8fde1571d49bf44f58f492ccad6875f9" title="Merge two leaf nodes.">merge_leaves</a>(leaf_node* left, leaf_node* right, inner_node* parent)
<a name="l03263"></a>03263     {
<a name="l03264"></a>03264         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Merge leaf nodes &quot;</span> &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; right &lt;&lt; <span class="stringliteral">&quot; with common parent &quot;</span> &lt;&lt; parent &lt;&lt; <span class="stringliteral">&quot;.&quot;</span>);
<a name="l03265"></a>03265         (void)parent;
<a name="l03266"></a>03266 
<a name="l03267"></a>03267         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;isleafnode() &amp;&amp; right-&gt;isleafnode());
<a name="l03268"></a>03268         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;level == 1);
<a name="l03269"></a>03269 
<a name="l03270"></a>03270         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;slotuse + right-&gt;slotuse &lt; <a class="code" href="a00001.html#ac6c274f39fce8e14f6a881fc1da39cf8" title="Base B+ tree parameter: The number of key/data slots in each leaf.">leafslotmax</a>);
<a name="l03271"></a>03271 
<a name="l03272"></a>03272         std::copy(right-&gt;slotkey, right-&gt;slotkey + right-&gt;slotuse,
<a name="l03273"></a>03273                   left-&gt;slotkey + left-&gt;slotuse);
<a name="l03274"></a>03274         <a class="code" href="a00001.html#ad8a89e088fbfedec4218ea46f8899941" title="Convenient template function for conditional copying of slotdata.">data_copy</a>(right-&gt;slotdata, right-&gt;slotdata + right-&gt;slotuse,
<a name="l03275"></a>03275                   left-&gt;slotdata + left-&gt;slotuse);
<a name="l03276"></a>03276 
<a name="l03277"></a>03277         left-&gt;slotuse += right-&gt;slotuse;
<a name="l03278"></a>03278 
<a name="l03279"></a>03279         left-&gt;nextleaf = right-&gt;nextleaf;
<a name="l03280"></a>03280         <span class="keywordflow">if</span> (left-&gt;nextleaf)
<a name="l03281"></a>03281             left-&gt;nextleaf-&gt;prevleaf = left;
<a name="l03282"></a>03282         <span class="keywordflow">else</span>
<a name="l03283"></a>03283             <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> = left;
<a name="l03284"></a>03284 
<a name="l03285"></a>03285         right-&gt;<a class="code" href="a00018.html#a3c6e7088a8ca73d43cec76973bb8f903" title="Number of key slotuse use, so number of valid children or data pointers.">slotuse</a> = 0;
<a name="l03286"></a>03286 
<a name="l03287"></a>03287         <span class="keywordflow">return</span> <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba22159386e444003f86027c412d28ef43" title="Deletion successful, children nodes were merged and the parent needs to remove the empty node...">btree_fixmerge</a>;
<a name="l03288"></a>03288     }
<a name="l03289"></a>03289 <span class="comment"></span>
<a name="l03290"></a>03290 <span class="comment">    /// Merge two inner nodes. The function moves all key/childid pairs from</span>
<a name="l03291"></a>03291 <span class="comment">    /// right to left and sets right&#39;s slotuse to zero. The right slot is then</span>
<a name="l03292"></a>03292 <span class="comment">    /// removed by the calling parent node.</span>
<a name="l03293"></a><a class="code" href="a00001.html#ae41ed6372b1f0e7cc76d082fb7d0c18c">03293</a> <span class="comment"></span>    <span class="keyword">static</span> result_t <a class="code" href="a00001.html#ae41ed6372b1f0e7cc76d082fb7d0c18c" title="Merge two inner nodes.">merge_inner</a>(inner_node* left, inner_node* right, inner_node* parent, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> parentslot)
<a name="l03294"></a>03294     {
<a name="l03295"></a>03295         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Merge inner nodes &quot;</span> &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot; and &quot;</span> &lt;&lt; right &lt;&lt; <span class="stringliteral">&quot; with common parent &quot;</span> &lt;&lt; parent &lt;&lt; <span class="stringliteral">&quot;.&quot;</span>);
<a name="l03296"></a>03296 
<a name="l03297"></a>03297         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;level == right-&gt;level);
<a name="l03298"></a>03298         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;level == left-&gt;level + 1);
<a name="l03299"></a>03299 
<a name="l03300"></a>03300         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[parentslot] == left);
<a name="l03301"></a>03301 
<a name="l03302"></a>03302         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;slotuse + right-&gt;slotuse &lt; <a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">innerslotmax</a>);
<a name="l03303"></a>03303 
<a name="l03304"></a>03304         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>)
<a name="l03305"></a>03305         {
<a name="l03306"></a>03306             <span class="comment">// find the left node&#39;s slot in the parent&#39;s children</span>
<a name="l03307"></a>03307             <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> leftslot = 0;
<a name="l03308"></a>03308             <span class="keywordflow">while</span>(leftslot &lt;= parent-&gt;slotuse &amp;&amp; parent-&gt;childid[leftslot] != left)
<a name="l03309"></a>03309                 ++leftslot;
<a name="l03310"></a>03310 
<a name="l03311"></a>03311             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leftslot &lt; parent-&gt;slotuse);
<a name="l03312"></a>03312             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[leftslot] == left);
<a name="l03313"></a>03313             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[leftslot+1] == right);
<a name="l03314"></a>03314 
<a name="l03315"></a>03315             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parentslot == leftslot);
<a name="l03316"></a>03316         }
<a name="l03317"></a>03317 
<a name="l03318"></a>03318         <span class="comment">// retrieve the decision key from parent</span>
<a name="l03319"></a>03319         left-&gt;slotkey[left-&gt;slotuse] = parent-&gt;slotkey[parentslot];
<a name="l03320"></a>03320         left-&gt;slotuse++;
<a name="l03321"></a>03321 
<a name="l03322"></a>03322         <span class="comment">// copy over keys and children from right</span>
<a name="l03323"></a>03323         std::copy(right-&gt;slotkey, right-&gt;slotkey + right-&gt;slotuse,
<a name="l03324"></a>03324                   left-&gt;slotkey + left-&gt;slotuse);
<a name="l03325"></a>03325         std::copy(right-&gt;childid, right-&gt;childid + right-&gt;slotuse+1,
<a name="l03326"></a>03326                   left-&gt;childid + left-&gt;slotuse);
<a name="l03327"></a>03327 
<a name="l03328"></a>03328         left-&gt;slotuse += right-&gt;slotuse;
<a name="l03329"></a>03329         right-&gt;slotuse = 0;
<a name="l03330"></a>03330 
<a name="l03331"></a>03331         <span class="keywordflow">return</span> <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba22159386e444003f86027c412d28ef43" title="Deletion successful, children nodes were merged and the parent needs to remove the empty node...">btree_fixmerge</a>;
<a name="l03332"></a>03332     }
<a name="l03333"></a>03333 <span class="comment"></span>
<a name="l03334"></a>03334 <span class="comment">    /// Balance two leaf nodes. The function moves key/data pairs from right to</span>
<a name="l03335"></a>03335 <span class="comment">    /// left so that both nodes are equally filled. The parent node is updated</span>
<a name="l03336"></a>03336 <span class="comment">    /// if possible.</span>
<a name="l03337"></a><a class="code" href="a00001.html#a11529634e6a0fd90440272d0b8caf249">03337</a> <span class="comment"></span>    <span class="keyword">static</span> result_t <a class="code" href="a00001.html#a11529634e6a0fd90440272d0b8caf249" title="Balance two leaf nodes.">shift_left_leaf</a>(leaf_node *left, leaf_node *right, inner_node *parent, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> parentslot)
<a name="l03338"></a>03338     {
<a name="l03339"></a>03339         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;isleafnode() &amp;&amp; right-&gt;isleafnode());
<a name="l03340"></a>03340         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;level == 1);
<a name="l03341"></a>03341 
<a name="l03342"></a>03342         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;nextleaf == right);
<a name="l03343"></a>03343         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left == right-&gt;prevleaf);
<a name="l03344"></a>03344 
<a name="l03345"></a>03345         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;slotuse &lt; right-&gt;slotuse);
<a name="l03346"></a>03346         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[parentslot] == left);
<a name="l03347"></a>03347 
<a name="l03348"></a>03348         <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> shiftnum = (right-&gt;slotuse - left-&gt;slotuse) &gt;&gt; 1;
<a name="l03349"></a>03349 
<a name="l03350"></a>03350         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Shifting (leaf) &quot;</span> &lt;&lt; shiftnum &lt;&lt; <span class="stringliteral">&quot; entries to left &quot;</span> &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot; from right &quot;</span> &lt;&lt; right &lt;&lt; <span class="stringliteral">&quot; with common parent &quot;</span> &lt;&lt; parent &lt;&lt; <span class="stringliteral">&quot;.&quot;</span>);
<a name="l03351"></a>03351 
<a name="l03352"></a>03352         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;slotuse + shiftnum &lt; <a class="code" href="a00001.html#ac6c274f39fce8e14f6a881fc1da39cf8" title="Base B+ tree parameter: The number of key/data slots in each leaf.">leafslotmax</a>);
<a name="l03353"></a>03353 
<a name="l03354"></a>03354         <span class="comment">// copy the first items from the right node to the last slot in the left node.</span>
<a name="l03355"></a>03355 
<a name="l03356"></a>03356         std::copy(right-&gt;slotkey, right-&gt;slotkey + shiftnum,
<a name="l03357"></a>03357                   left-&gt;slotkey + left-&gt;slotuse);
<a name="l03358"></a>03358         <a class="code" href="a00001.html#ad8a89e088fbfedec4218ea46f8899941" title="Convenient template function for conditional copying of slotdata.">data_copy</a>(right-&gt;slotdata, right-&gt;slotdata + shiftnum,
<a name="l03359"></a>03359                   left-&gt;slotdata + left-&gt;slotuse);
<a name="l03360"></a>03360 
<a name="l03361"></a>03361         left-&gt;slotuse += shiftnum;
<a name="l03362"></a>03362 
<a name="l03363"></a>03363         <span class="comment">// shift all slots in the right node to the left</span>
<a name="l03364"></a>03364 
<a name="l03365"></a>03365         std::copy(right-&gt;slotkey + shiftnum, right-&gt;slotkey + right-&gt;slotuse,
<a name="l03366"></a>03366                   right-&gt;slotkey);
<a name="l03367"></a>03367         <a class="code" href="a00001.html#ad8a89e088fbfedec4218ea46f8899941" title="Convenient template function for conditional copying of slotdata.">data_copy</a>(right-&gt;slotdata + shiftnum, right-&gt;slotdata + right-&gt;slotuse,
<a name="l03368"></a>03368                   right-&gt;slotdata);
<a name="l03369"></a>03369 
<a name="l03370"></a>03370         right-&gt;slotuse -= shiftnum;
<a name="l03371"></a>03371 
<a name="l03372"></a>03372         <span class="comment">// fixup parent</span>
<a name="l03373"></a>03373         <span class="keywordflow">if</span> (parentslot &lt; parent-&gt;slotuse) {
<a name="l03374"></a>03374             parent-&gt;slotkey[parentslot] = left-&gt;slotkey[left-&gt;slotuse - 1];
<a name="l03375"></a>03375             <span class="keywordflow">return</span> <a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02bae9409a8c5c6d8b59e3fd6a70e1106d88" title="Deletion successful and no fix-ups necessary.">btree_ok</a>;
<a name="l03376"></a>03376         }
<a name="l03377"></a>03377         <span class="keywordflow">else</span> { <span class="comment">// the update is further up the tree</span>
<a name="l03378"></a>03378             <span class="keywordflow">return</span> result_t(<a class="code" href="a00001.html#a971345163fcd46bfd726cb31ad5cd02ba7e66903441bb2c3c8164040f9efea0d8" title="Deletion successful, the last key was updated so parent slotkeys need updates.">btree_update_lastkey</a>, left-&gt;slotkey[left-&gt;slotuse - 1]);
<a name="l03379"></a>03379         }
<a name="l03380"></a>03380     }
<a name="l03381"></a>03381 <span class="comment"></span>
<a name="l03382"></a>03382 <span class="comment">    /// Balance two inner nodes. The function moves key/data pairs from right</span>
<a name="l03383"></a>03383 <span class="comment">    /// to left so that both nodes are equally filled. The parent node is</span>
<a name="l03384"></a>03384 <span class="comment">    /// updated if possible.</span>
<a name="l03385"></a><a class="code" href="a00001.html#a8abbc58dfcbb672bc1273a402b57b750">03385</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="a00001.html#a8abbc58dfcbb672bc1273a402b57b750" title="Balance two inner nodes.">shift_left_inner</a>(inner_node *left, inner_node *right, inner_node *parent, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> parentslot)
<a name="l03386"></a>03386     {
<a name="l03387"></a>03387         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;level == right-&gt;level);
<a name="l03388"></a>03388         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;level == left-&gt;level + 1);
<a name="l03389"></a>03389 
<a name="l03390"></a>03390         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;slotuse &lt; right-&gt;slotuse);
<a name="l03391"></a>03391         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[parentslot] == left);
<a name="l03392"></a>03392 
<a name="l03393"></a>03393         <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> shiftnum = (right-&gt;slotuse - left-&gt;slotuse) &gt;&gt; 1;
<a name="l03394"></a>03394 
<a name="l03395"></a>03395         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Shifting (inner) &quot;</span> &lt;&lt; shiftnum &lt;&lt; <span class="stringliteral">&quot; entries to left &quot;</span> &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot; from right &quot;</span> &lt;&lt; right &lt;&lt; <span class="stringliteral">&quot; with common parent &quot;</span> &lt;&lt; parent &lt;&lt; <span class="stringliteral">&quot;.&quot;</span>);
<a name="l03396"></a>03396 
<a name="l03397"></a>03397         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;slotuse + shiftnum &lt; <a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">innerslotmax</a>);
<a name="l03398"></a>03398 
<a name="l03399"></a>03399         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>)
<a name="l03400"></a>03400         {
<a name="l03401"></a>03401             <span class="comment">// find the left node&#39;s slot in the parent&#39;s children and compare to parentslot</span>
<a name="l03402"></a>03402 
<a name="l03403"></a>03403             <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> leftslot = 0;
<a name="l03404"></a>03404             <span class="keywordflow">while</span>(leftslot &lt;= parent-&gt;slotuse &amp;&amp; parent-&gt;childid[leftslot] != left)
<a name="l03405"></a>03405                 ++leftslot;
<a name="l03406"></a>03406 
<a name="l03407"></a>03407             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leftslot &lt; parent-&gt;slotuse);
<a name="l03408"></a>03408             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[leftslot] == left);
<a name="l03409"></a>03409             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[leftslot+1] == right);
<a name="l03410"></a>03410 
<a name="l03411"></a>03411             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leftslot == parentslot);
<a name="l03412"></a>03412         }
<a name="l03413"></a>03413 
<a name="l03414"></a>03414         <span class="comment">// copy the parent&#39;s decision slotkey and childid to the first new key on the left</span>
<a name="l03415"></a>03415         left-&gt;slotkey[left-&gt;slotuse] = parent-&gt;slotkey[parentslot];
<a name="l03416"></a>03416         left-&gt;slotuse++;
<a name="l03417"></a>03417 
<a name="l03418"></a>03418         <span class="comment">// copy the other items from the right node to the last slots in the left node.</span>
<a name="l03419"></a>03419 
<a name="l03420"></a>03420         std::copy(right-&gt;slotkey, right-&gt;slotkey + shiftnum-1,
<a name="l03421"></a>03421                   left-&gt;slotkey + left-&gt;slotuse);
<a name="l03422"></a>03422         std::copy(right-&gt;childid, right-&gt;childid + shiftnum,
<a name="l03423"></a>03423                   left-&gt;childid + left-&gt;slotuse);
<a name="l03424"></a>03424 
<a name="l03425"></a>03425         left-&gt;slotuse += shiftnum - 1;
<a name="l03426"></a>03426 
<a name="l03427"></a>03427         <span class="comment">// fixup parent</span>
<a name="l03428"></a>03428         parent-&gt;slotkey[parentslot] = right-&gt;slotkey[shiftnum - 1];
<a name="l03429"></a>03429 
<a name="l03430"></a>03430         <span class="comment">// shift all slots in the right node</span>
<a name="l03431"></a>03431 
<a name="l03432"></a>03432         std::copy(right-&gt;slotkey + shiftnum, right-&gt;slotkey + right-&gt;slotuse,
<a name="l03433"></a>03433                   right-&gt;slotkey);
<a name="l03434"></a>03434         std::copy(right-&gt;childid + shiftnum, right-&gt;childid + right-&gt;slotuse+1,
<a name="l03435"></a>03435                   right-&gt;childid);
<a name="l03436"></a>03436 
<a name="l03437"></a>03437         right-&gt;slotuse -= shiftnum;
<a name="l03438"></a>03438     }
<a name="l03439"></a>03439 <span class="comment"></span>
<a name="l03440"></a>03440 <span class="comment">    /// Balance two leaf nodes. The function moves key/data pairs from left to</span>
<a name="l03441"></a>03441 <span class="comment">    /// right so that both nodes are equally filled. The parent node is updated</span>
<a name="l03442"></a>03442 <span class="comment">    /// if possible.</span>
<a name="l03443"></a><a class="code" href="a00001.html#acb8565c057e6c9923adbae0e96f51523">03443</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="a00001.html#acb8565c057e6c9923adbae0e96f51523" title="Balance two leaf nodes.">shift_right_leaf</a>(leaf_node *left, leaf_node *right, inner_node *parent, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> parentslot)
<a name="l03444"></a>03444     {
<a name="l03445"></a>03445         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;isleafnode() &amp;&amp; right-&gt;isleafnode());
<a name="l03446"></a>03446         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;level == 1);
<a name="l03447"></a>03447 
<a name="l03448"></a>03448         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;nextleaf == right);
<a name="l03449"></a>03449         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left == right-&gt;prevleaf);
<a name="l03450"></a>03450         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[parentslot] == left);
<a name="l03451"></a>03451 
<a name="l03452"></a>03452         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;slotuse &gt; right-&gt;slotuse);
<a name="l03453"></a>03453 
<a name="l03454"></a>03454         <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> shiftnum = (left-&gt;slotuse - right-&gt;slotuse) &gt;&gt; 1;
<a name="l03455"></a>03455 
<a name="l03456"></a>03456         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Shifting (leaf) &quot;</span> &lt;&lt; shiftnum &lt;&lt; <span class="stringliteral">&quot; entries to right &quot;</span> &lt;&lt; right &lt;&lt; <span class="stringliteral">&quot; from left &quot;</span> &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot; with common parent &quot;</span> &lt;&lt; parent &lt;&lt; <span class="stringliteral">&quot;.&quot;</span>);
<a name="l03457"></a>03457 
<a name="l03458"></a>03458         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>)
<a name="l03459"></a>03459         {
<a name="l03460"></a>03460             <span class="comment">// find the left node&#39;s slot in the parent&#39;s children</span>
<a name="l03461"></a>03461             <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> leftslot = 0;
<a name="l03462"></a>03462             <span class="keywordflow">while</span>(leftslot &lt;= parent-&gt;slotuse &amp;&amp; parent-&gt;childid[leftslot] != left)
<a name="l03463"></a>03463                 ++leftslot;
<a name="l03464"></a>03464 
<a name="l03465"></a>03465             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leftslot &lt; parent-&gt;slotuse);
<a name="l03466"></a>03466             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[leftslot] == left);
<a name="l03467"></a>03467             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[leftslot+1] == right);
<a name="l03468"></a>03468 
<a name="l03469"></a>03469             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leftslot == parentslot);
<a name="l03470"></a>03470         }
<a name="l03471"></a>03471 
<a name="l03472"></a>03472         <span class="comment">// shift all slots in the right node</span>
<a name="l03473"></a>03473 
<a name="l03474"></a>03474         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(right-&gt;slotuse + shiftnum &lt; <a class="code" href="a00001.html#ac6c274f39fce8e14f6a881fc1da39cf8" title="Base B+ tree parameter: The number of key/data slots in each leaf.">leafslotmax</a>);
<a name="l03475"></a>03475 
<a name="l03476"></a>03476         std::copy_backward(right-&gt;slotkey, right-&gt;slotkey + right-&gt;slotuse,
<a name="l03477"></a>03477                            right-&gt;slotkey + right-&gt;slotuse + shiftnum);
<a name="l03478"></a>03478         <a class="code" href="a00001.html#a555a24bfd925a5d77bba28041d207f8d" title="Convenient template function for conditional copying of slotdata.">data_copy_backward</a>(right-&gt;slotdata, right-&gt;slotdata + right-&gt;slotuse,
<a name="l03479"></a>03479                            right-&gt;slotdata + right-&gt;slotuse + shiftnum);
<a name="l03480"></a>03480 
<a name="l03481"></a>03481         right-&gt;slotuse += shiftnum;
<a name="l03482"></a>03482 
<a name="l03483"></a>03483         <span class="comment">// copy the last items from the left node to the first slot in the right node.</span>
<a name="l03484"></a>03484         std::copy(left-&gt;slotkey + left-&gt;slotuse - shiftnum, left-&gt;slotkey + left-&gt;slotuse,
<a name="l03485"></a>03485                   right-&gt;slotkey);
<a name="l03486"></a>03486         <a class="code" href="a00001.html#ad8a89e088fbfedec4218ea46f8899941" title="Convenient template function for conditional copying of slotdata.">data_copy</a>(left-&gt;slotdata + left-&gt;slotuse - shiftnum, left-&gt;slotdata + left-&gt;slotuse,
<a name="l03487"></a>03487                   right-&gt;slotdata);
<a name="l03488"></a>03488 
<a name="l03489"></a>03489         left-&gt;slotuse -= shiftnum;
<a name="l03490"></a>03490 
<a name="l03491"></a>03491         parent-&gt;slotkey[parentslot] = left-&gt;slotkey[left-&gt;slotuse-1];
<a name="l03492"></a>03492     }
<a name="l03493"></a>03493 <span class="comment"></span>
<a name="l03494"></a>03494 <span class="comment">    /// Balance two inner nodes. The function moves key/data pairs from left to</span>
<a name="l03495"></a>03495 <span class="comment">    /// right so that both nodes are equally filled. The parent node is updated</span>
<a name="l03496"></a>03496 <span class="comment">    /// if possible.</span>
<a name="l03497"></a><a class="code" href="a00001.html#a4aebdb2c529528d5f17d14b9b0ec1f24">03497</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="a00001.html#a4aebdb2c529528d5f17d14b9b0ec1f24" title="Balance two inner nodes.">shift_right_inner</a>(inner_node *left, inner_node *right, inner_node *parent, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> parentslot)
<a name="l03498"></a>03498     {
<a name="l03499"></a>03499         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;level == right-&gt;level);
<a name="l03500"></a>03500         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;level == left-&gt;level + 1);
<a name="l03501"></a>03501 
<a name="l03502"></a>03502         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(left-&gt;slotuse &gt; right-&gt;slotuse);
<a name="l03503"></a>03503         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[parentslot] == left);
<a name="l03504"></a>03504 
<a name="l03505"></a>03505         <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> shiftnum = (left-&gt;slotuse - right-&gt;slotuse) &gt;&gt; 1;
<a name="l03506"></a>03506 
<a name="l03507"></a>03507         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;Shifting (leaf) &quot;</span> &lt;&lt; shiftnum &lt;&lt; <span class="stringliteral">&quot; entries to right &quot;</span> &lt;&lt; right &lt;&lt; <span class="stringliteral">&quot; from left &quot;</span> &lt;&lt; left &lt;&lt; <span class="stringliteral">&quot; with common parent &quot;</span> &lt;&lt; parent &lt;&lt; <span class="stringliteral">&quot;.&quot;</span>);
<a name="l03508"></a>03508 
<a name="l03509"></a>03509         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>)
<a name="l03510"></a>03510         {
<a name="l03511"></a>03511             <span class="comment">// find the left node&#39;s slot in the parent&#39;s children</span>
<a name="l03512"></a>03512             <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> leftslot = 0;
<a name="l03513"></a>03513             <span class="keywordflow">while</span>(leftslot &lt;= parent-&gt;slotuse &amp;&amp; parent-&gt;childid[leftslot] != left)
<a name="l03514"></a>03514                 ++leftslot;
<a name="l03515"></a>03515 
<a name="l03516"></a>03516             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leftslot &lt; parent-&gt;slotuse);
<a name="l03517"></a>03517             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[leftslot] == left);
<a name="l03518"></a>03518             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(parent-&gt;childid[leftslot+1] == right);
<a name="l03519"></a>03519 
<a name="l03520"></a>03520             <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(leftslot == parentslot);
<a name="l03521"></a>03521         }
<a name="l03522"></a>03522 
<a name="l03523"></a>03523         <span class="comment">// shift all slots in the right node</span>
<a name="l03524"></a>03524 
<a name="l03525"></a>03525         <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(right-&gt;slotuse + shiftnum &lt; <a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">innerslotmax</a>);
<a name="l03526"></a>03526 
<a name="l03527"></a>03527         std::copy_backward(right-&gt;slotkey, right-&gt;slotkey + right-&gt;slotuse,
<a name="l03528"></a>03528                            right-&gt;slotkey + right-&gt;slotuse + shiftnum);
<a name="l03529"></a>03529         std::copy_backward(right-&gt;childid, right-&gt;childid + right-&gt;slotuse+1,
<a name="l03530"></a>03530                            right-&gt;childid + right-&gt;slotuse+1 + shiftnum);
<a name="l03531"></a>03531 
<a name="l03532"></a>03532         right-&gt;slotuse += shiftnum;
<a name="l03533"></a>03533 
<a name="l03534"></a>03534         <span class="comment">// copy the parent&#39;s decision slotkey and childid to the last new key on the right</span>
<a name="l03535"></a>03535         right-&gt;slotkey[shiftnum - 1] = parent-&gt;slotkey[parentslot];
<a name="l03536"></a>03536 
<a name="l03537"></a>03537         <span class="comment">// copy the remaining last items from the left node to the first slot in the right node.</span>
<a name="l03538"></a>03538         std::copy(left-&gt;slotkey + left-&gt;slotuse - shiftnum+1, left-&gt;slotkey + left-&gt;slotuse,
<a name="l03539"></a>03539                   right-&gt;slotkey);
<a name="l03540"></a>03540         std::copy(left-&gt;childid + left-&gt;slotuse - shiftnum+1, left-&gt;childid + left-&gt;slotuse+1,
<a name="l03541"></a>03541                   right-&gt;childid);
<a name="l03542"></a>03542 
<a name="l03543"></a>03543         <span class="comment">// copy the first to-be-removed key from the left node to the parent&#39;s decision slot</span>
<a name="l03544"></a>03544         parent-&gt;slotkey[parentslot] = left-&gt;slotkey[left-&gt;slotuse - shiftnum];
<a name="l03545"></a>03545 
<a name="l03546"></a>03546         left-&gt;slotuse -= shiftnum;
<a name="l03547"></a>03547     }
<a name="l03548"></a>03548 
<a name="l03549"></a>03549 <span class="preprocessor">#ifdef BTREE_DEBUG</span>
<a name="l03550"></a>03550 <span class="preprocessor"></span><span class="keyword">public</span>:
<a name="l03551"></a>03551     <span class="comment">// *** Debug Printing</span>
<a name="l03552"></a>03552 <span class="comment"></span>
<a name="l03553"></a>03553 <span class="comment">    /// Print out the B+ tree structure with keys onto the given ostream. This</span>
<a name="l03554"></a>03554 <span class="comment">    /// function requires that the header is compiled with BTREE_DEBUG and that</span>
<a name="l03555"></a>03555 <span class="comment">    /// key_type is printable via std::ostream.</span>
<a name="l03556"></a><a class="code" href="a00001.html#a29af931b81dc3446d1ffadab6fd5e017">03556</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#a29af931b81dc3446d1ffadab6fd5e017" title="Print out the B+ tree structure with keys onto the given ostream.">print</a>(std::ostream &amp;os)<span class="keyword"> const</span>
<a name="l03557"></a>03557 <span class="keyword">    </span>{
<a name="l03558"></a>03558         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>) {
<a name="l03559"></a>03559             <a class="code" href="a00001.html#a7a031022658d93a4d7d92522947816b4" title="Recursively descend down the tree and print out nodes.">print_node</a>(os, <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>, 0, <span class="keyword">true</span>);
<a name="l03560"></a>03560         }
<a name="l03561"></a>03561     }
<a name="l03562"></a>03562 <span class="comment"></span>
<a name="l03563"></a>03563 <span class="comment">    /// Print out only the leaves via the double linked list.</span>
<a name="l03564"></a><a class="code" href="a00001.html#a2e9097d4266851d84d9e3813921155c6">03564</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#a2e9097d4266851d84d9e3813921155c6" title="Print out only the leaves via the double linked list.">print_leaves</a>(std::ostream &amp;os)<span class="keyword"> const</span>
<a name="l03565"></a>03565 <span class="keyword">    </span>{
<a name="l03566"></a>03566         os &lt;&lt; <span class="stringliteral">&quot;leaves:&quot;</span> &lt;&lt; std::endl;
<a name="l03567"></a>03567 
<a name="l03568"></a>03568         <span class="keyword">const</span> leaf_node *n = <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>;
<a name="l03569"></a>03569 
<a name="l03570"></a>03570         <span class="keywordflow">while</span>(n)
<a name="l03571"></a>03571         {
<a name="l03572"></a>03572             os &lt;&lt; <span class="stringliteral">&quot;  &quot;</span> &lt;&lt; n &lt;&lt; std::endl;
<a name="l03573"></a>03573 
<a name="l03574"></a>03574             n = n-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a>;
<a name="l03575"></a>03575         }
<a name="l03576"></a>03576     }
<a name="l03577"></a>03577 
<a name="l03578"></a>03578 <span class="keyword">private</span>:
<a name="l03579"></a>03579 <span class="comment"></span>
<a name="l03580"></a>03580 <span class="comment">    /// Recursively descend down the tree and print out nodes.</span>
<a name="l03581"></a><a class="code" href="a00001.html#a7a031022658d93a4d7d92522947816b4">03581</a> <span class="comment"></span>    <span class="keyword">static</span> <span class="keywordtype">void</span> <a class="code" href="a00001.html#a7a031022658d93a4d7d92522947816b4" title="Recursively descend down the tree and print out nodes.">print_node</a>(std::ostream &amp;os, <span class="keyword">const</span> node* node, <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> depth=0, <span class="keywordtype">bool</span> recursive=<span class="keyword">false</span>)
<a name="l03582"></a>03582     {
<a name="l03583"></a>03583         <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; depth; i++) os &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;
<a name="l03584"></a>03584 
<a name="l03585"></a>03585         os &lt;&lt; <span class="stringliteral">&quot;node &quot;</span> &lt;&lt; node &lt;&lt; <span class="stringliteral">&quot; level &quot;</span> &lt;&lt; node-&gt;level &lt;&lt; <span class="stringliteral">&quot; slotuse &quot;</span> &lt;&lt; node-&gt;slotuse &lt;&lt; std::endl;
<a name="l03586"></a>03586 
<a name="l03587"></a>03587         <span class="keywordflow">if</span> (node-&gt;isleafnode())
<a name="l03588"></a>03588         {
<a name="l03589"></a>03589             <span class="keyword">const</span> leaf_node *leafnode = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>leaf_node*<span class="keyword">&gt;</span>(node);
<a name="l03590"></a>03590 
<a name="l03591"></a>03591             <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; depth; i++) os &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;
<a name="l03592"></a>03592             os &lt;&lt; <span class="stringliteral">&quot;  leaf prev &quot;</span> &lt;&lt; leafnode-&gt;prevleaf &lt;&lt; <span class="stringliteral">&quot; next &quot;</span> &lt;&lt; leafnode-&gt;nextleaf &lt;&lt; std::endl;
<a name="l03593"></a>03593 
<a name="l03594"></a>03594             <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; depth; i++) os &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;
<a name="l03595"></a>03595 
<a name="l03596"></a>03596             <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> slot = 0; slot &lt; leafnode-&gt;slotuse; ++slot)
<a name="l03597"></a>03597             {
<a name="l03598"></a>03598                 os &lt;&lt; leafnode-&gt;slotkey[slot] &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>; <span class="comment">// &lt;&lt; &quot;(data: &quot; &lt;&lt; leafnode-&gt;slotdata[slot] &lt;&lt; &quot;) &quot;;</span>
<a name="l03599"></a>03599             }
<a name="l03600"></a>03600             os &lt;&lt; std::endl;
<a name="l03601"></a>03601         }
<a name="l03602"></a>03602         <span class="keywordflow">else</span>
<a name="l03603"></a>03603         {
<a name="l03604"></a>03604             <span class="keyword">const</span> inner_node *innernode = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(node);
<a name="l03605"></a>03605 
<a name="l03606"></a>03606             <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> i = 0; i &lt; depth; i++) os &lt;&lt; <span class="stringliteral">&quot;  &quot;</span>;
<a name="l03607"></a>03607 
<a name="l03608"></a>03608             <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> slot = 0; slot &lt; innernode-&gt;slotuse; ++slot)
<a name="l03609"></a>03609             {
<a name="l03610"></a>03610                 os &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; innernode-&gt;childid[slot] &lt;&lt; <span class="stringliteral">&quot;) &quot;</span> &lt;&lt; innernode-&gt;slotkey[slot] &lt;&lt; <span class="stringliteral">&quot; &quot;</span>;
<a name="l03611"></a>03611             }
<a name="l03612"></a>03612             os &lt;&lt; <span class="stringliteral">&quot;(&quot;</span> &lt;&lt; innernode-&gt;childid[innernode-&gt;slotuse] &lt;&lt; <span class="stringliteral">&quot;)&quot;</span> &lt;&lt; std::endl;
<a name="l03613"></a>03613 
<a name="l03614"></a>03614             <span class="keywordflow">if</span> (recursive)
<a name="l03615"></a>03615             {
<a name="l03616"></a>03616                 <span class="keywordflow">for</span> (<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> slot = 0; slot &lt; innernode-&gt;slotuse + 1; ++slot)
<a name="l03617"></a>03617                 {
<a name="l03618"></a>03618                     <a class="code" href="a00001.html#a7a031022658d93a4d7d92522947816b4" title="Recursively descend down the tree and print out nodes.">print_node</a>(os, innernode-&gt;childid[slot], depth + 1, recursive);
<a name="l03619"></a>03619                 }
<a name="l03620"></a>03620             }
<a name="l03621"></a>03621         }
<a name="l03622"></a>03622     }
<a name="l03623"></a>03623 <span class="preprocessor">#endif</span>
<a name="l03624"></a>03624 <span class="preprocessor"></span>
<a name="l03625"></a>03625 <span class="keyword">public</span>:
<a name="l03626"></a>03626     <span class="comment">// *** Verification of B+ Tree Invariants</span>
<a name="l03627"></a>03627 <span class="comment"></span>
<a name="l03628"></a>03628 <span class="comment">    /// Run a thorough verification of all B+ tree invariants. The program</span>
<a name="l03629"></a>03629 <span class="comment">    /// aborts via assert() if something is wrong.</span>
<a name="l03630"></a><a class="code" href="a00001.html#ad7008114b409fe53a5739a69f3b90e59">03630</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#ad7008114b409fe53a5739a69f3b90e59" title="Run a thorough verification of all B+ tree invariants.">verify</a>()<span class="keyword"> const</span>
<a name="l03631"></a>03631 <span class="keyword">    </span>{
<a name="l03632"></a>03632         <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> minkey, maxkey;
<a name="l03633"></a>03633         tree_stats vstats;
<a name="l03634"></a>03634 
<a name="l03635"></a>03635         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>)
<a name="l03636"></a>03636         {
<a name="l03637"></a>03637             <a class="code" href="a00001.html#a3691c46df55869209c7221844f48217c" title="Recursively descend down the tree and verify each node.">verify_node</a>(<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>, &amp;minkey, &amp;maxkey, vstats);
<a name="l03638"></a>03638 
<a name="l03639"></a>03639             assert( vstats.itemcount == <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a> );
<a name="l03640"></a>03640             assert( vstats.leaves == <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#aa4d4f72b9a8f7a58424063aa1d4a1fcc" title="Number of leaves in the B+ tree.">leaves</a> );
<a name="l03641"></a>03641             assert( vstats.innernodes == <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#ab63b03a814b985680a46151fd9f59e17" title="Number of inner nodes in the B+ tree.">innernodes</a> );
<a name="l03642"></a>03642 
<a name="l03643"></a>03643             <a class="code" href="a00001.html#ae89a72438aead5bbc0e2cf0b01999291" title="Verify the double linked list of leaves.">verify_leaflinks</a>();
<a name="l03644"></a>03644         }
<a name="l03645"></a>03645     }
<a name="l03646"></a>03646 
<a name="l03647"></a>03647 <span class="keyword">private</span>:
<a name="l03648"></a>03648 <span class="comment"></span>
<a name="l03649"></a>03649 <span class="comment">    /// Recursively descend down the tree and verify each node</span>
<a name="l03650"></a><a class="code" href="a00001.html#a3691c46df55869209c7221844f48217c">03650</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#a3691c46df55869209c7221844f48217c" title="Recursively descend down the tree and verify each node.">verify_node</a>(<span class="keyword">const</span> node* n, <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>* minkey, <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>* maxkey, tree_stats &amp;vstats)<span class="keyword"> const</span>
<a name="l03651"></a>03651 <span class="keyword">    </span>{
<a name="l03652"></a>03652         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;verifynode &quot;</span> &lt;&lt; n);
<a name="l03653"></a>03653 
<a name="l03654"></a>03654         <span class="keywordflow">if</span> (n-&gt;isleafnode())
<a name="l03655"></a>03655         {
<a name="l03656"></a>03656             <span class="keyword">const</span> leaf_node *leaf = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l03657"></a>03657 
<a name="l03658"></a>03658             assert( leaf == <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> || !leaf-&gt;isunderflow() );
<a name="l03659"></a>03659             assert( leaf-&gt;slotuse &gt; 0 );
<a name="l03660"></a>03660 
<a name="l03661"></a>03661             <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> slot = 0; slot &lt; leaf-&gt;slotuse - 1; ++slot)
<a name="l03662"></a>03662             {
<a name="l03663"></a>03663                 assert(<a class="code" href="a00001.html#a1a0b97590280a37b8622b000fe4d2d07" title="True if a &lt;= b ? constructed from key_less()">key_lessequal</a>(leaf-&gt;slotkey[slot], leaf-&gt;slotkey[slot + 1]));
<a name="l03664"></a>03664             }
<a name="l03665"></a>03665 
<a name="l03666"></a>03666             *minkey = leaf-&gt;slotkey[0];
<a name="l03667"></a>03667             *maxkey = leaf-&gt;slotkey[leaf-&gt;slotuse - 1];
<a name="l03668"></a>03668 
<a name="l03669"></a>03669             vstats.leaves++;
<a name="l03670"></a>03670             vstats.itemcount += leaf-&gt;slotuse;
<a name="l03671"></a>03671         }
<a name="l03672"></a>03672         <span class="keywordflow">else</span> <span class="comment">// !n-&gt;isleafnode()</span>
<a name="l03673"></a>03673         {
<a name="l03674"></a>03674             <span class="keyword">const</span> inner_node *inner = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l03675"></a>03675             vstats.innernodes++;
<a name="l03676"></a>03676 
<a name="l03677"></a>03677             assert( inner == <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> || !inner-&gt;isunderflow() );
<a name="l03678"></a>03678             assert( inner-&gt;slotuse &gt; 0 );
<a name="l03679"></a>03679 
<a name="l03680"></a>03680             <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> slot = 0; slot &lt; inner-&gt;slotuse - 1; ++slot)
<a name="l03681"></a>03681             {
<a name="l03682"></a>03682                 assert(<a class="code" href="a00001.html#a1a0b97590280a37b8622b000fe4d2d07" title="True if a &lt;= b ? constructed from key_less()">key_lessequal</a>(inner-&gt;slotkey[slot], inner-&gt;slotkey[slot + 1]));
<a name="l03683"></a>03683             }
<a name="l03684"></a>03684 
<a name="l03685"></a>03685             <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> slot = 0; slot &lt;= inner-&gt;slotuse; ++slot)
<a name="l03686"></a>03686             {
<a name="l03687"></a>03687                 <span class="keyword">const</span> node *subnode = inner-&gt;childid[slot];
<a name="l03688"></a>03688                 <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> subminkey = <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>();
<a name="l03689"></a>03689                 <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a> submaxkey = <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">key_type</a>();
<a name="l03690"></a>03690 
<a name="l03691"></a>03691                 assert(subnode-&gt;level + 1 == inner-&gt;level);
<a name="l03692"></a>03692                 <a class="code" href="a00001.html#a3691c46df55869209c7221844f48217c" title="Recursively descend down the tree and verify each node.">verify_node</a>(subnode, &amp;subminkey, &amp;submaxkey, vstats);
<a name="l03693"></a>03693 
<a name="l03694"></a>03694                 <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;verify subnode &quot;</span> &lt;&lt; subnode &lt;&lt; <span class="stringliteral">&quot;: &quot;</span> &lt;&lt; subminkey &lt;&lt; <span class="stringliteral">&quot; - &quot;</span> &lt;&lt; submaxkey);
<a name="l03695"></a>03695 
<a name="l03696"></a>03696                 <span class="keywordflow">if</span> (slot == 0)
<a name="l03697"></a>03697                     *minkey = subminkey;
<a name="l03698"></a>03698                 <span class="keywordflow">else</span>
<a name="l03699"></a>03699                     assert(<a class="code" href="a00001.html#a7d9e621a7b8c3e88820e49874381ec1b" title="True if a &gt;= b ? constructed from key_less()">key_greaterequal</a>(subminkey, inner-&gt;slotkey[slot-1]));
<a name="l03700"></a>03700 
<a name="l03701"></a>03701                 <span class="keywordflow">if</span> (slot == inner-&gt;slotuse)
<a name="l03702"></a>03702                     *maxkey = submaxkey;
<a name="l03703"></a>03703                 <span class="keywordflow">else</span>
<a name="l03704"></a>03704                     assert(<a class="code" href="a00001.html#ac3b0c8e750101dfad0ef70c54532dd68" title="True if a == b ? constructed from key_less().">key_equal</a>(inner-&gt;slotkey[slot], submaxkey));
<a name="l03705"></a>03705 
<a name="l03706"></a>03706                 <span class="keywordflow">if</span> (inner-&gt;level == 1 &amp;&amp; slot &lt; inner-&gt;slotuse)
<a name="l03707"></a>03707                 {
<a name="l03708"></a>03708                     <span class="comment">// children are leaves and must be linked together in the</span>
<a name="l03709"></a>03709                     <span class="comment">// correct order</span>
<a name="l03710"></a>03710                     <span class="keyword">const</span> leaf_node *leafa = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>leaf_node*<span class="keyword">&gt;</span>(inner-&gt;childid[slot]);
<a name="l03711"></a>03711                     <span class="keyword">const</span> leaf_node *leafb = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>leaf_node*<span class="keyword">&gt;</span>(inner-&gt;childid[slot + 1]);
<a name="l03712"></a>03712 
<a name="l03713"></a>03713                     assert(leafa-&gt;nextleaf == leafb);
<a name="l03714"></a>03714                     assert(leafa == leafb-&gt;prevleaf);
<a name="l03715"></a>03715                     (void)leafa; (void)leafb;
<a name="l03716"></a>03716                 }
<a name="l03717"></a>03717                 <span class="keywordflow">if</span> (inner-&gt;level == 2 &amp;&amp; slot &lt; inner-&gt;slotuse)
<a name="l03718"></a>03718                 {
<a name="l03719"></a>03719                     <span class="comment">// verify leaf links between the adjacent inner nodes</span>
<a name="l03720"></a>03720                     <span class="keyword">const</span> inner_node *parenta = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(inner-&gt;childid[slot]);
<a name="l03721"></a>03721                     <span class="keyword">const</span> inner_node *parentb = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(inner-&gt;childid[slot+1]);
<a name="l03722"></a>03722 
<a name="l03723"></a>03723                     <span class="keyword">const</span> leaf_node *leafa = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>leaf_node*<span class="keyword">&gt;</span>(parenta-&gt;childid[parenta-&gt;slotuse]);
<a name="l03724"></a>03724                     <span class="keyword">const</span> leaf_node *leafb = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>leaf_node*<span class="keyword">&gt;</span>(parentb-&gt;childid[0]);
<a name="l03725"></a>03725 
<a name="l03726"></a>03726                     assert(leafa-&gt;nextleaf == leafb);
<a name="l03727"></a>03727                     assert(leafa == leafb-&gt;prevleaf);
<a name="l03728"></a>03728                     (void)leafa; (void)leafb;
<a name="l03729"></a>03729                 }
<a name="l03730"></a>03730             }
<a name="l03731"></a>03731         }
<a name="l03732"></a>03732     }
<a name="l03733"></a>03733 <span class="comment"></span>
<a name="l03734"></a>03734 <span class="comment">    /// Verify the double linked list of leaves.</span>
<a name="l03735"></a><a class="code" href="a00001.html#ae89a72438aead5bbc0e2cf0b01999291">03735</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#ae89a72438aead5bbc0e2cf0b01999291" title="Verify the double linked list of leaves.">verify_leaflinks</a>()<span class="keyword"> const</span>
<a name="l03736"></a>03736 <span class="keyword">    </span>{
<a name="l03737"></a>03737         <span class="keyword">const</span> leaf_node *n = <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a>;
<a name="l03738"></a>03738 
<a name="l03739"></a>03739         assert(n-&gt;level == 0);
<a name="l03740"></a>03740         assert(!n || n-&gt;prevleaf == NULL);
<a name="l03741"></a>03741 
<a name="l03742"></a>03742         <span class="keywordtype">unsigned</span> <span class="keywordtype">int</span> testcount = 0;
<a name="l03743"></a>03743 
<a name="l03744"></a>03744         <span class="keywordflow">while</span>(n)
<a name="l03745"></a>03745         {
<a name="l03746"></a>03746             assert(n-&gt;level == 0);
<a name="l03747"></a>03747             assert(n-&gt;slotuse &gt; 0);
<a name="l03748"></a>03748 
<a name="l03749"></a>03749             <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> slot = 0; slot &lt; n-&gt;slotuse - 1; ++slot)
<a name="l03750"></a>03750             {
<a name="l03751"></a>03751                 assert(<a class="code" href="a00001.html#a1a0b97590280a37b8622b000fe4d2d07" title="True if a &lt;= b ? constructed from key_less()">key_lessequal</a>(n-&gt;slotkey[slot], n-&gt;slotkey[slot + 1]));
<a name="l03752"></a>03752             }
<a name="l03753"></a>03753 
<a name="l03754"></a>03754             testcount += n-&gt;slotuse;
<a name="l03755"></a>03755 
<a name="l03756"></a>03756             <span class="keywordflow">if</span> (n-&gt;nextleaf)
<a name="l03757"></a>03757             {
<a name="l03758"></a>03758                 assert(<a class="code" href="a00001.html#a1a0b97590280a37b8622b000fe4d2d07" title="True if a &lt;= b ? constructed from key_less()">key_lessequal</a>(n-&gt;slotkey[n-&gt;slotuse-1], n-&gt;nextleaf-&gt;slotkey[0]));
<a name="l03759"></a>03759 
<a name="l03760"></a>03760                 assert(n == n-&gt;nextleaf-&gt;prevleaf);
<a name="l03761"></a>03761             }
<a name="l03762"></a>03762             <span class="keywordflow">else</span>
<a name="l03763"></a>03763             {
<a name="l03764"></a>03764                 assert(<a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> == n);
<a name="l03765"></a>03765             }
<a name="l03766"></a>03766 
<a name="l03767"></a>03767             n = n-&gt;nextleaf;
<a name="l03768"></a>03768         }
<a name="l03769"></a>03769 
<a name="l03770"></a>03770         assert(testcount == <a class="code" href="a00001.html#a3942d7144bc93cf094b62f03e6113f4e" title="Return the number of key/data pairs in the B+ tree.">size</a>());
<a name="l03771"></a>03771     }
<a name="l03772"></a>03772 
<a name="l03773"></a>03773 <span class="keyword">private</span>:
<a name="l03774"></a>03774     <span class="comment">// *** Dump and Restore of B+ Trees</span>
<a name="l03775"></a>03775 <span class="comment"></span>
<a name="l03776"></a>03776 <span class="comment">    /// A header for the binary image containing the base properties of the B+</span>
<a name="l03777"></a>03777 <span class="comment">    /// tree. These properties have to match the current template</span>
<a name="l03778"></a>03778 <span class="comment">    /// instantiation.</span>
<a name="l03779"></a><a class="code" href="a00012.html">03779</a> <span class="comment"></span>    <span class="keyword">struct </span><a class="code" href="a00012.html" title="A header for the binary image containing the base properties of the B+ tree.">dump_header</a>
<a name="l03780"></a>03780     {<span class="comment"></span>
<a name="l03781"></a>03781 <span class="comment">        /// &quot;stx-btree&quot;, just to stop the restore() function from loading garbage</span>
<a name="l03782"></a><a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925">03782</a> <span class="comment"></span>        <span class="keywordtype">char</span>            <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[12];
<a name="l03783"></a>03783 <span class="comment"></span>
<a name="l03784"></a>03784 <span class="comment">        /// Currently 0</span>
<a name="l03785"></a><a class="code" href="a00012.html#a71d827c1ccd04d8e6233ff219912c595">03785</a> <span class="comment"></span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>  <a class="code" href="a00012.html#a71d827c1ccd04d8e6233ff219912c595" title="Currently 0.">version</a>;
<a name="l03786"></a>03786 <span class="comment"></span>
<a name="l03787"></a>03787 <span class="comment">        /// sizeof(key_type)</span>
<a name="l03788"></a><a class="code" href="a00012.html#a8f67df3531d38ffcef8ad82d9da065f3">03788</a> <span class="comment"></span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>  <a class="code" href="a00012.html#a8f67df3531d38ffcef8ad82d9da065f3" title="sizeof(key_type)">key_type_size</a>;
<a name="l03789"></a>03789 <span class="comment"></span>
<a name="l03790"></a>03790 <span class="comment">        /// sizeof(data_type)</span>
<a name="l03791"></a><a class="code" href="a00012.html#a536d42c9baeada7861b53418cd57f956">03791</a> <span class="comment"></span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>  <a class="code" href="a00012.html#a536d42c9baeada7861b53418cd57f956" title="sizeof(data_type)">data_type_size</a>;
<a name="l03792"></a>03792 <span class="comment"></span>
<a name="l03793"></a>03793 <span class="comment">        /// Number of slots in the leaves</span>
<a name="l03794"></a><a class="code" href="a00012.html#ad34685edd1951aa742a1ead6e964e9d1">03794</a> <span class="comment"></span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>  <a class="code" href="a00012.html#ad34685edd1951aa742a1ead6e964e9d1" title="Number of slots in the leaves.">leafslots</a>;
<a name="l03795"></a>03795 <span class="comment"></span>
<a name="l03796"></a>03796 <span class="comment">        /// Number of slots in the inner nodes</span>
<a name="l03797"></a><a class="code" href="a00012.html#aa30e74b5b93fa0b4357a69d81c1c3158">03797</a> <span class="comment"></span>        <span class="keywordtype">unsigned</span> <span class="keywordtype">short</span>  <a class="code" href="a00012.html#aa30e74b5b93fa0b4357a69d81c1c3158" title="Number of slots in the inner nodes.">innerslots</a>;
<a name="l03798"></a>03798 <span class="comment"></span>
<a name="l03799"></a>03799 <span class="comment">        /// Allow duplicates</span>
<a name="l03800"></a><a class="code" href="a00012.html#a6c34468093568a6008699cf81e489cc4">03800</a> <span class="comment"></span>        <span class="keywordtype">bool</span>            <a class="code" href="a00012.html#a6c34468093568a6008699cf81e489cc4" title="Allow duplicates.">allow_duplicates</a>;
<a name="l03801"></a>03801 <span class="comment"></span>
<a name="l03802"></a>03802 <span class="comment">        /// The item count of the tree</span>
<a name="l03803"></a><a class="code" href="a00012.html#ac6afd8dcd6ff5b432cbea929e7d9092a">03803</a> <span class="comment"></span>        <a class="code" href="a00001.html#aa692f5303dd2c4fee4958cbbfc3db5da" title="Size type used to count keys.">size_type</a>       <a class="code" href="a00012.html#ac6afd8dcd6ff5b432cbea929e7d9092a" title="The item count of the tree.">itemcount</a>;
<a name="l03804"></a>03804 <span class="comment"></span>
<a name="l03805"></a>03805 <span class="comment">        /// Fill the struct with the current B+ tree&#39;s properties, itemcount is</span>
<a name="l03806"></a>03806 <span class="comment">        /// not filled.</span>
<a name="l03807"></a><a class="code" href="a00012.html#a9860eb582bc28a17920c4a8e28128231">03807</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="a00012.html#a9860eb582bc28a17920c4a8e28128231" title="Fill the struct with the current B+ tree&#39;s properties, itemcount is not filled.">fill</a>()
<a name="l03808"></a>03808         {
<a name="l03809"></a>03809             <span class="comment">// don&#39;t want to include string.h just for this signature</span>
<a name="l03810"></a>03810             <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[0] = <span class="charliteral">&#39;s&#39;</span>; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[1] = <span class="charliteral">&#39;t&#39;</span>; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[2] = <span class="charliteral">&#39;x&#39;</span>; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[3] = <span class="charliteral">&#39;-&#39;</span>;
<a name="l03811"></a>03811             <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[4] = <span class="charliteral">&#39;b&#39;</span>; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[5] = <span class="charliteral">&#39;t&#39;</span>; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[6] = <span class="charliteral">&#39;r&#39;</span>; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[7] = <span class="charliteral">&#39;e&#39;</span>;
<a name="l03812"></a>03812             <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[8] = <span class="charliteral">&#39;e&#39;</span>; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[9] = 0; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[10] = 0; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[11] = 0;
<a name="l03813"></a>03813 
<a name="l03814"></a>03814             <a class="code" href="a00012.html#a71d827c1ccd04d8e6233ff219912c595" title="Currently 0.">version</a> = 0;
<a name="l03815"></a>03815             <a class="code" href="a00012.html#a8f67df3531d38ffcef8ad82d9da065f3" title="sizeof(key_type)">key_type_size</a> = <span class="keyword">sizeof</span>(<span class="keyword">typename</span> <a class="code" href="a00001.html#a73a9d635f33527a1329937f3e5f0ee5a" title="First template parameter: The key type of the B+ tree.">btree_self::key_type</a>);
<a name="l03816"></a>03816             <a class="code" href="a00012.html#a536d42c9baeada7861b53418cd57f956" title="sizeof(data_type)">data_type_size</a> = <span class="keyword">sizeof</span>(<span class="keyword">typename</span> <a class="code" href="a00001.html#acfb48ad6a3845870e64c38dd1b562616" title="Second template parameter: The data type associated with each key.">btree_self::data_type</a>);
<a name="l03817"></a>03817             <a class="code" href="a00012.html#ad34685edd1951aa742a1ead6e964e9d1" title="Number of slots in the leaves.">leafslots</a> = <a class="code" href="a00001.html#ac6c274f39fce8e14f6a881fc1da39cf8" title="Base B+ tree parameter: The number of key/data slots in each leaf.">btree_self::leafslotmax</a>;
<a name="l03818"></a>03818             <a class="code" href="a00012.html#aa30e74b5b93fa0b4357a69d81c1c3158" title="Number of slots in the inner nodes.">innerslots</a> = <a class="code" href="a00001.html#a78ae296638b9d6961f9101ddf45bf3e0" title="Base B+ tree parameter: The number of key slots in each inner node, this can differ from slots in eac...">btree_self::innerslotmax</a>;
<a name="l03819"></a>03819             <a class="code" href="a00012.html#a6c34468093568a6008699cf81e489cc4" title="Allow duplicates.">allow_duplicates</a> = <a class="code" href="a00012.html#a6c34468093568a6008699cf81e489cc4" title="Allow duplicates.">btree_self::allow_duplicates</a>;
<a name="l03820"></a>03820         }
<a name="l03821"></a>03821 <span class="comment"></span>
<a name="l03822"></a>03822 <span class="comment">        /// Returns true if the headers have the same vital properties</span>
<a name="l03823"></a><a class="code" href="a00012.html#a8af9b3bcc5f4e1370c343116afcef6fe">03823</a> <span class="comment"></span>        <span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="a00012.html#a8af9b3bcc5f4e1370c343116afcef6fe" title="Returns true if the headers have the same vital properties.">same</a>(<span class="keyword">const</span> <span class="keyword">struct</span> <a class="code" href="a00012.html" title="A header for the binary image containing the base properties of the B+ tree.">dump_header</a> &amp;o)<span class="keyword"> const</span>
<a name="l03824"></a>03824 <span class="keyword">        </span>{
<a name="l03825"></a>03825             <span class="keywordflow">return</span> (<a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[0] == <span class="charliteral">&#39;s&#39;</span> &amp;&amp; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[1] == <span class="charliteral">&#39;t&#39;</span> &amp;&amp; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[2] == <span class="charliteral">&#39;x&#39;</span> &amp;&amp; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[3] == <span class="charliteral">&#39;-&#39;</span> &amp;&amp;
<a name="l03826"></a>03826                     <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[4] == <span class="charliteral">&#39;b&#39;</span> &amp;&amp; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[5] == <span class="charliteral">&#39;t&#39;</span> &amp;&amp; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[6] == <span class="charliteral">&#39;r&#39;</span> &amp;&amp; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[7] == <span class="charliteral">&#39;e&#39;</span> &amp;&amp;
<a name="l03827"></a>03827                     <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[8] == <span class="charliteral">&#39;e&#39;</span> &amp;&amp; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[9] == 0 &amp;&amp; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[10] == 0 &amp;&amp; <a class="code" href="a00012.html#ab44be47294b727f4a876cc210c498925" title="&quot;stx-btree&quot;, just to stop the restore() function from loading garbage">signature</a>[11] == 0)
<a name="l03828"></a>03828                 &amp;&amp; (<a class="code" href="a00012.html#a71d827c1ccd04d8e6233ff219912c595" title="Currently 0.">version</a> == o.<a class="code" href="a00012.html#a71d827c1ccd04d8e6233ff219912c595" title="Currently 0.">version</a>)
<a name="l03829"></a>03829                 &amp;&amp; (<a class="code" href="a00012.html#a8f67df3531d38ffcef8ad82d9da065f3" title="sizeof(key_type)">key_type_size</a> == o.<a class="code" href="a00012.html#a8f67df3531d38ffcef8ad82d9da065f3" title="sizeof(key_type)">key_type_size</a>)
<a name="l03830"></a>03830                 &amp;&amp; (<a class="code" href="a00012.html#a536d42c9baeada7861b53418cd57f956" title="sizeof(data_type)">data_type_size</a> == o.<a class="code" href="a00012.html#a536d42c9baeada7861b53418cd57f956" title="sizeof(data_type)">data_type_size</a>)
<a name="l03831"></a>03831                 &amp;&amp; (<a class="code" href="a00012.html#ad34685edd1951aa742a1ead6e964e9d1" title="Number of slots in the leaves.">leafslots</a> == o.<a class="code" href="a00012.html#ad34685edd1951aa742a1ead6e964e9d1" title="Number of slots in the leaves.">leafslots</a>)
<a name="l03832"></a>03832                 &amp;&amp; (<a class="code" href="a00012.html#aa30e74b5b93fa0b4357a69d81c1c3158" title="Number of slots in the inner nodes.">innerslots</a> == o.<a class="code" href="a00012.html#aa30e74b5b93fa0b4357a69d81c1c3158" title="Number of slots in the inner nodes.">innerslots</a>)
<a name="l03833"></a>03833                 &amp;&amp; (<a class="code" href="a00012.html#a6c34468093568a6008699cf81e489cc4" title="Allow duplicates.">allow_duplicates</a> == o.<a class="code" href="a00012.html#a6c34468093568a6008699cf81e489cc4" title="Allow duplicates.">allow_duplicates</a>);
<a name="l03834"></a>03834         }
<a name="l03835"></a>03835     };
<a name="l03836"></a>03836 
<a name="l03837"></a>03837 <span class="keyword">public</span>:
<a name="l03838"></a>03838 <span class="comment"></span>
<a name="l03839"></a>03839 <span class="comment">    /// Dump the contents of the B+ tree out onto an ostream as a binary</span>
<a name="l03840"></a>03840 <span class="comment">    /// image. The image contains memory pointers which will be fixed when the</span>
<a name="l03841"></a>03841 <span class="comment">    /// image is restored. For this to work your key_type and data_type must be</span>
<a name="l03842"></a>03842 <span class="comment">    /// integral types and contain no pointers or references.</span>
<a name="l03843"></a><a class="code" href="a00001.html#af26da2c6a1723bd3c98229b3670e2d28">03843</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#af26da2c6a1723bd3c98229b3670e2d28" title="Dump the contents of the B+ tree out onto an ostream as a binary image.">dump</a>(std::ostream &amp;os)<span class="keyword"> const</span>
<a name="l03844"></a>03844 <span class="keyword">    </span>{
<a name="l03845"></a>03845         <span class="keyword">struct </span>dump_header header;
<a name="l03846"></a>03846         header.fill();
<a name="l03847"></a>03847         header.itemcount = <a class="code" href="a00001.html#a3942d7144bc93cf094b62f03e6113f4e" title="Return the number of key/data pairs in the B+ tree.">size</a>();
<a name="l03848"></a>03848 
<a name="l03849"></a>03849         os.write(reinterpret_cast&lt;char*&gt;(&amp;header), <span class="keyword">sizeof</span>(header));
<a name="l03850"></a>03850 
<a name="l03851"></a>03851         <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>) {
<a name="l03852"></a>03852             <a class="code" href="a00001.html#ad4ad2abd47967f9a7d89730bd5a0380d" title="Recursively descend down the tree and dump each node in a precise order.">dump_node</a>(os, <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a>);
<a name="l03853"></a>03853         }
<a name="l03854"></a>03854     }
<a name="l03855"></a>03855 <span class="comment"></span>
<a name="l03856"></a>03856 <span class="comment">    /// Restore a binary image of a dumped B+ tree from an istream. The B+ tree</span>
<a name="l03857"></a>03857 <span class="comment">    /// pointers are fixed using the dump order. For dump and restore to work</span>
<a name="l03858"></a>03858 <span class="comment">    /// your key_type and data_type must be integral types and contain no</span>
<a name="l03859"></a>03859 <span class="comment">    /// pointers or references. Returns true if the restore was successful.</span>
<a name="l03860"></a><a class="code" href="a00001.html#adf438d8a86c9784e277adfbb6ed5783d">03860</a> <span class="comment"></span>    <span class="keywordtype">bool</span> <a class="code" href="a00001.html#adf438d8a86c9784e277adfbb6ed5783d" title="Restore a binary image of a dumped B+ tree from an istream.">restore</a>(std::istream &amp;is)
<a name="l03861"></a>03861     {
<a name="l03862"></a>03862         <span class="keyword">struct </span>dump_header fileheader;
<a name="l03863"></a>03863         is.read(reinterpret_cast&lt;char*&gt;(&amp;fileheader), <span class="keyword">sizeof</span>(fileheader));
<a name="l03864"></a>03864         <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l03865"></a>03865 
<a name="l03866"></a>03866         <span class="keyword">struct </span>dump_header myheader;
<a name="l03867"></a>03867         myheader.fill();
<a name="l03868"></a>03868         myheader.itemcount = fileheader.itemcount;
<a name="l03869"></a>03869 
<a name="l03870"></a>03870         <span class="keywordflow">if</span> (!myheader.same(fileheader))
<a name="l03871"></a>03871         {
<a name="l03872"></a>03872             <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;btree::restore: file header does not match instantiation signature.&quot;</span>);
<a name="l03873"></a>03873             <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l03874"></a>03874         }
<a name="l03875"></a>03875 
<a name="l03876"></a>03876         <a class="code" href="a00001.html#aa2acf975007740100b9803fcea573036" title="Frees all key/data pairs and all nodes of the tree.">clear</a>();
<a name="l03877"></a>03877 
<a name="l03878"></a>03878         <span class="keywordflow">if</span> (fileheader.itemcount &gt; 0)
<a name="l03879"></a>03879         {
<a name="l03880"></a>03880             <a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> = <a class="code" href="a00001.html#a90299b74161abaef68c886e2d53ad490" title="Read the dump image and construct a tree from the node order in the serialization.">restore_node</a>(is);
<a name="l03881"></a>03881             <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a359f38ed7d0557cd5726ecf80f868e80" title="Pointer to the B+ tree&#39;s root node, either leaf or inner node.">m_root</a> == NULL) <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l03882"></a>03882 
<a name="l03883"></a>03883             <a class="code" href="a00001.html#ac1971d7f227239aae76a2a88657a31a3" title="Other small statistics about the B+ tree.">m_stats</a>.<a class="code" href="a00021.html#afef2ae775091d9913de5ebfb84ef7aae" title="Number of items in the B+ tree.">itemcount</a> = fileheader.itemcount;
<a name="l03884"></a>03884         }
<a name="l03885"></a>03885 
<a name="l03886"></a>03886 <span class="preprocessor">#ifdef BTREE_DEBUG</span>
<a name="l03887"></a>03887 <span class="preprocessor"></span>        <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a224f31a88d50490e14f0f291d70ef2fc" title="Debug parameter: Prints out lots of debug information about how the algorithms change the tree...">debug</a>) <a class="code" href="a00001.html#a29af931b81dc3446d1ffadab6fd5e017" title="Print out the B+ tree structure with keys onto the given ostream.">print</a>(std::cout);
<a name="l03888"></a>03888 <span class="preprocessor">#endif</span>
<a name="l03889"></a>03889 <span class="preprocessor"></span>        <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a598601fa16cfb97b8b60a4eae6bde5ae" title="Debug parameter: Enables expensive and thorough checking of the B+ tree invariants after each insert/...">selfverify</a>) <a class="code" href="a00001.html#ad7008114b409fe53a5739a69f3b90e59" title="Run a thorough verification of all B+ tree invariants.">verify</a>();
<a name="l03890"></a>03890 
<a name="l03891"></a>03891         <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l03892"></a>03892     }
<a name="l03893"></a>03893 
<a name="l03894"></a>03894 <span class="keyword">private</span>:
<a name="l03895"></a>03895 <span class="comment"></span>
<a name="l03896"></a>03896 <span class="comment">    /// Recursively descend down the tree and dump each node in a precise order</span>
<a name="l03897"></a><a class="code" href="a00001.html#ad4ad2abd47967f9a7d89730bd5a0380d">03897</a> <span class="comment"></span>    <span class="keywordtype">void</span> <a class="code" href="a00001.html#ad4ad2abd47967f9a7d89730bd5a0380d" title="Recursively descend down the tree and dump each node in a precise order.">dump_node</a>(std::ostream &amp;os, <span class="keyword">const</span> node* n)<span class="keyword"> const</span>
<a name="l03898"></a>03898 <span class="keyword">    </span>{
<a name="l03899"></a>03899         <a class="code" href="a00026.html#acd87b40df0c1d4ead6fac13b49cb5345" title="Print out debug information to std::cout if BTREE_DEBUG is defined.">BTREE_PRINT</a>(<span class="stringliteral">&quot;dump_node &quot;</span> &lt;&lt; n &lt;&lt; std::endl);
<a name="l03900"></a>03900 
<a name="l03901"></a>03901         <span class="keywordflow">if</span> (n-&gt;isleafnode())
<a name="l03902"></a>03902         {
<a name="l03903"></a>03903             <span class="keyword">const</span> leaf_node *leaf = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>leaf_node*<span class="keyword">&gt;</span>(n);
<a name="l03904"></a>03904 
<a name="l03905"></a>03905             os.write(reinterpret_cast&lt;const char*&gt;(leaf), <span class="keyword">sizeof</span>(*leaf));
<a name="l03906"></a>03906         }
<a name="l03907"></a>03907         <span class="keywordflow">else</span> <span class="comment">// !n-&gt;isleafnode()</span>
<a name="l03908"></a>03908         {
<a name="l03909"></a>03909             <span class="keyword">const</span> inner_node *inner = <span class="keyword">static_cast&lt;</span><span class="keyword">const </span>inner_node*<span class="keyword">&gt;</span>(n);
<a name="l03910"></a>03910 
<a name="l03911"></a>03911             os.write(reinterpret_cast&lt;const char*&gt;(inner), <span class="keyword">sizeof</span>(*inner));
<a name="l03912"></a>03912 
<a name="l03913"></a>03913             <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> slot = 0; slot &lt;= inner-&gt;slotuse; ++slot)
<a name="l03914"></a>03914             {
<a name="l03915"></a>03915                 <span class="keyword">const</span> node *subnode = inner-&gt;childid[slot];
<a name="l03916"></a>03916 
<a name="l03917"></a>03917                 <a class="code" href="a00001.html#ad4ad2abd47967f9a7d89730bd5a0380d" title="Recursively descend down the tree and dump each node in a precise order.">dump_node</a>(os, subnode);
<a name="l03918"></a>03918             }
<a name="l03919"></a>03919         }
<a name="l03920"></a>03920     }
<a name="l03921"></a>03921 <span class="comment"></span>
<a name="l03922"></a>03922 <span class="comment">    /// Read the dump image and construct a tree from the node order in the</span>
<a name="l03923"></a>03923 <span class="comment">    /// serialization.</span>
<a name="l03924"></a><a class="code" href="a00001.html#a90299b74161abaef68c886e2d53ad490">03924</a> <span class="comment"></span>    node* <a class="code" href="a00001.html#a90299b74161abaef68c886e2d53ad490" title="Read the dump image and construct a tree from the node order in the serialization.">restore_node</a>(std::istream &amp;is)
<a name="l03925"></a>03925     {
<a name="l03926"></a>03926         <span class="keyword">union </span>{
<a name="l03927"></a>03927             node        top;
<a name="l03928"></a>03928             leaf_node   leaf;
<a name="l03929"></a>03929             inner_node  inner;
<a name="l03930"></a>03930         } nu;
<a name="l03931"></a>03931 
<a name="l03932"></a>03932         <span class="comment">// first read only the top of the node</span>
<a name="l03933"></a>03933         is.read(reinterpret_cast&lt;char*&gt;(&amp;nu.top), <span class="keyword">sizeof</span>(nu.top));
<a name="l03934"></a>03934         <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">return</span> NULL;
<a name="l03935"></a>03935 
<a name="l03936"></a>03936         <span class="keywordflow">if</span> (nu.top.isleafnode())
<a name="l03937"></a>03937         {
<a name="l03938"></a>03938             <span class="comment">// read remaining data of leaf node</span>
<a name="l03939"></a>03939             is.read(reinterpret_cast&lt;char*&gt;(&amp;nu.leaf) + <span class="keyword">sizeof</span>(nu.top), <span class="keyword">sizeof</span>(nu.leaf) - <span class="keyword">sizeof</span>(nu.top));
<a name="l03940"></a>03940             <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">return</span> NULL;
<a name="l03941"></a>03941 
<a name="l03942"></a>03942             leaf_node *newleaf = <a class="code" href="a00001.html#ab6ff4b0f13f48e417a45431318a00337" title="Allocate and initialize a leaf node.">allocate_leaf</a>();
<a name="l03943"></a>03943 
<a name="l03944"></a>03944             <span class="comment">// copy over all data, the leaf nodes contain only their double linked list pointers</span>
<a name="l03945"></a>03945             *newleaf = nu.leaf;
<a name="l03946"></a>03946 
<a name="l03947"></a>03947             <span class="comment">// reconstruct the linked list from the order in the file</span>
<a name="l03948"></a>03948             <span class="keywordflow">if</span> (<a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a> == NULL) {
<a name="l03949"></a>03949                 <a class="code" href="a00026.html#a6ac57b9b59dae34aea28cda65b0d14bb" title="Assertion only if BTREE_DEBUG is defined. This is not used in verify().">BTREE_ASSERT</a>(newleaf-&gt;prevleaf == NULL);
<a name="l03950"></a>03950                 <a class="code" href="a00001.html#a13acabf72d2c7d380bfd49fc8cb946aa" title="Pointer to first leaf in the double linked leaf chain.">m_headleaf</a> = <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> = newleaf;
<a name="l03951"></a>03951             }
<a name="l03952"></a>03952             <span class="keywordflow">else</span> {
<a name="l03953"></a>03953                 newleaf-&gt;<a class="code" href="a00017.html#a56890dc287b29ae39f3e070a26cae000" title="Double linked list pointers to traverse the leaves.">prevleaf</a> = <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>;
<a name="l03954"></a>03954                 <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a>-&gt;<a class="code" href="a00017.html#a32f06cf3a6f67709039ca40851b03367" title="Double linked list pointers to traverse the leaves.">nextleaf</a> = newleaf;
<a name="l03955"></a>03955                 <a class="code" href="a00001.html#a570d9cb259032b2ce9c5edce77afbcc7" title="Pointer to last leaf in the double linked leaf chain.">m_tailleaf</a> = newleaf;
<a name="l03956"></a>03956             }
<a name="l03957"></a>03957 
<a name="l03958"></a>03958             <span class="keywordflow">return</span> newleaf;
<a name="l03959"></a>03959         }
<a name="l03960"></a>03960         <span class="keywordflow">else</span>
<a name="l03961"></a>03961         {
<a name="l03962"></a>03962             <span class="comment">// read remaining data of inner node</span>
<a name="l03963"></a>03963             is.read(reinterpret_cast&lt;char*&gt;(&amp;nu.inner) + <span class="keyword">sizeof</span>(nu.top), <span class="keyword">sizeof</span>(nu.inner) - <span class="keyword">sizeof</span>(nu.top));
<a name="l03964"></a>03964             <span class="keywordflow">if</span> (!is.good()) <span class="keywordflow">return</span> NULL;
<a name="l03965"></a>03965 
<a name="l03966"></a>03966             inner_node *newinner = <a class="code" href="a00001.html#a1bf04093f2dc2a1cb57955ff55d3762a" title="Allocate and initialize an inner node.">allocate_inner</a>(0);
<a name="l03967"></a>03967 
<a name="l03968"></a>03968             <span class="comment">// copy over all data, the inner nodes contain only pointers to their children</span>
<a name="l03969"></a>03969             *newinner = nu.inner;
<a name="l03970"></a>03970 
<a name="l03971"></a>03971             <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">short</span> slot = 0; slot &lt;= newinner-&gt;slotuse; ++slot)
<a name="l03972"></a>03972             {
<a name="l03973"></a>03973                 newinner-&gt;childid[slot] = <a class="code" href="a00001.html#a90299b74161abaef68c886e2d53ad490" title="Read the dump image and construct a tree from the node order in the serialization.">restore_node</a>(is);
<a name="l03974"></a>03974             }
<a name="l03975"></a>03975 
<a name="l03976"></a>03976             <span class="keywordflow">return</span> newinner;
<a name="l03977"></a>03977         }
<a name="l03978"></a>03978     }
<a name="l03979"></a>03979 };
<a name="l03980"></a>03980 
<a name="l03981"></a>03981 } <span class="comment">// namespace stx</span>
<a name="l03982"></a>03982 
<a name="l03983"></a>03983 <span class="preprocessor">#endif // _STX_BTREE_H_</span>
</pre></div></div><!-- contents -->
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Namespaces</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(10)"><span class="SelectionMark">&#160;</span>Defines</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>



<hr class="footer"/><address class="footer"><small>
Generated on Sun May 5 2013 23:38:43 for STX B+ Tree Template Classes by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.7.6.1
</small></address>

</body>
</html>
